|
|
|
|
|
|
Date Reviewed |
|
|
1 - 10 of 21
reviews
|
|
|
|
|
|
|
|
Community mining on dynamic weighted directed graphs Duan D., Li Y., Jin Y., Lu Z. CNIKM 2009 (Proceeding of the 1st ACM International Workshop on Complex Networks Meet Information & Knowledge Management, Hong Kong, China, Nov 6, 2009) 11-18, 2009. Type: Proceedings
An important research issue in graph mining is the discovery of communities--subsets of nodes that are likely to comprise a group....
|
Mar 17 2010 |
|
|
|
|
|
|
Scale free interval graphs Miyoshi N., Shigezumi T., Uehara R., Watanabe O. Theoretical Computer Science 410(45): 4588-4600, 2009. Type: Article
Generating realistic graphs is a very important tool, since this process can lead to synthetic graphs with properties that characterize real-life networks. Therefore, synthetically generated graphs can be used in performance evaluation...
|
Jan 29 2010 |
|
|
|
|
|
|
Visualizing inter-dependencies between scenarios Harel D., Segall I. SoftVis 2008 (Proceedings of the 4th ACM Symposium on Software Visualization, Ammersee, Germany, Sep 16-17, 2008) 145-153, 2008. Type: Proceedings
Live sequence chart (LSC) is a highly expressive language for specification and programming, which is based on charts that capture interdependencies between modules. The focus of this research is the visualization of interdependencies ...
|
Aug 13 2009 |
|
|
|
|
|
|
Improved layout of phylogenetic networks Gambette P., Huson D. IEEE/ACM Transactions on Computational Biology and Bioinformatics 5(3): 472-479, 2008. Type: Article
Phylogenetic trees are important structures used in biology and bioinformatics. Basically, they are used to model the evolution of a species. The authors study algorithms for drawing phylogenetic trees and, specifically, split networks...
|
Apr 29 2009 |
|
|
|
|
|
|
Walrasian equilibrium: hardness, approximations and tractable instances Chen N., Rudra A. Algorithmica 52(1): 44-64, 2008. Type: Article
As auctions gain importance, particularly in e-commerce, auction data processing is becoming a popular application. Auctions are an intuitive means of expressing interest in particular items: buyers choose an item, offer a price for it...
|
Mar 23 2009 |
|
|
|
|
|
|
Estimating rates of rare events at multiple resolutions Agarwal D., Broder A., Chakrabarti D., Diklic D., Josifovski V., Sayyadian M. Knowledge discovery and data mining (Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Jose, California, Aug 12-15, 2007) 16-25, 2007. Type: Proceedings
Statistics are very important in understanding the way users behave. Many Web pages contain ads, and judging the effectiveness of these ads is an important issue. Toward this goal, the authors present a method to estimate the rate of c...
|
Jul 31 2008 |
|
|
|
|
|
|
Detecting time series motifs under uniform scaling Yankov D., Keogh E., Medina J., Chiu B., Zordan V. Knowledge discovery and data mining (Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Jose, California, Aug 12-15, 2007) 844-853, 2007. Type: Proceedings
A one-dimensional time series is composed of values that change over time. Time series are frequently used in applications such as stock price analysis and sensor measurements. Therefore, a time series is represented as a sequence of v...
|
May 9 2008 |
|
|
|
|
|
|
Online stochastic combinatorial optimization Hentenryck P., Bent R., The MIT Press, 2006. 236 pp. Type: Book (9780262220804), Reviews: (2 of 2)
Optimization techniques are very important for solving difficult problems. Traditional methods work in an a priori fashion, trying to satisfy problem constraints without taking into consideration changes or unpredicted events that may ...
|
Jan 23 2008 |
|
|
|
|
|
|
Modeling and managing changes in text databases Ipeirotis P., Ntoulas A., Cho J., Gravano L. ACM Transactions on Database Systems 32(3): 14-es, 2007. Type: Article
Web-accessible text databases contain large quantities of textual information. Users may search this information using general-purpose search engines or other specialized tools. Text documents are represented by content summaries, whic...
|
Dec 20 2007 |
|
|
|
|
|
|
A pruning-based approach for supporting Top-K join queries Liu J., Feng L., Xing Y. World wide Web (Proceedings of the 15th International Conference on the World Wide Web, Edinburgh, Scotland, May 23-26, 2006) 891-892, 2006. Type: Proceedings
Top-k queries are very important in database management systems and information retrieval systems because they help in selecting the “best” objects. The value of the parameter k...
|
Sep 14 2007 |
|
|
|
|
|
|
|
|
|
|
|