Sciweavers

415 search results - page 14 / 83
» Optimally Reconstructing Weighted Graphs Using Queries
Sort
View
IMC
2005
ACM
14 years 1 months ago
Improving Sketch Reconstruction Accuracy Using Linear Least Squares Method
Sketch is a sublinear space data structure that allows one to approximately reconstruct the value associated with any given key in an input data stream. It is the basis for answer...
Gene Moo Lee, Huiya Liu, Young Yoon, Yin Zhang
COLING
2010
13 years 2 months ago
Learning Web Query Patterns for Imitating Wikipedia Articles
This paper presents a novel method for acquiring a set of query patterns to retrieve documents containing important information about an entity. Given an existing Wikipedia catego...
Shohei Tanaka, Naoaki Okazaki, Mitsuru Ishizuka
ESA
2003
Springer
95views Algorithms» more  ESA 2003»
14 years 28 days ago
Sequencing by Hybridization in Few Rounds
Sequencing by Hybridization (SBH) is a method for reconstructing an unknown DNA string based on obtaining, through hybridization experiments, whether certain short strings appear ...
Dekel Tsur
ICDE
2012
IEEE
232views Database» more  ICDE 2012»
11 years 10 months ago
Horton: Online Query Execution Engine for Large Distributed Graphs
—Large graphs are used in many applications, such as social networking. The management of these graphs poses new challenges because such graphs are too large to fit on a single ...
Mohamed Sarwat, Sameh Elnikety, Yuxiong He, Gabrie...
ICDE
2007
IEEE
207views Database» more  ICDE 2007»
14 years 9 months ago
SIGOPT: Using Schema to Optimize XML Query Processing
There has been a great deal of work in recent years on processing and optimizing queries against XML data. Typically in these previous works, schema information is not considered,...
Stelios Paparizos, Jignesh M. Patel, H. V. Jagadis...