Sciweavers

415 search results - page 15 / 83
» Optimally Reconstructing Weighted Graphs Using Queries
Sort
View
WSDM
2012
ACM
236views Data Mining» more  WSDM 2012»
12 years 3 months ago
Effective query formulation with multiple information sources
Most standard information retrieval models use a single source of information (e.g., the retrieval corpus) for query formulation tasks such as term and phrase weighting and query ...
Michael Bendersky, Donald Metzler, W. Bruce Croft
PLDI
2011
ACM
12 years 10 months ago
Isolating and understanding concurrency errors using reconstructed execution fragments
In this paper we propose Recon, a new general approach to concurrency debugging. Recon goes beyond just detecting bugs, it also presents to the programmer short fragments of buggy...
Brandon Lucia, Benjamin P. Wood, Luis Ceze
SODA
2008
ACM
104views Algorithms» more  SODA 2008»
13 years 9 months ago
Fast and reliable reconstruction of phylogenetic trees with very short edges
Abstract Ilan Gronau Shlomo Moran Sagi Snir Phylogenetic reconstruction is the problem of reconstructing an evolutionary tree from sequences corresponding to leaves of that tree. ...
Ilan Gronau, Shlomo Moran, Sagi Snir
ECCV
2008
Springer
14 years 9 months ago
An Experimental Comparison of Discrete and Continuous Shape Optimization Methods
Shape optimization is a problem which arises in numerous computer vision problems such as image segmentation and multiview reconstruction. In this paper, we focus on a certain clas...
Maria Klodt, Thomas Schoenemann, Kalin Kolev, Mare...
ICDE
2003
IEEE
170views Database» more  ICDE 2003»
14 years 9 months ago
Keyword Proximity Search on XML Graphs
XKeyword provides efficient keyword proximity queries on large XML graph databases. A query is simply a list of keywords and does not require any schema or query language knowledg...
Vagelis Hristidis, Yannis Papakonstantinou, Andrey...