Sciweavers

656 search results - page 42 / 132
» Large-Graph Layout Algorithms at Work: An Experimental Study
Sort
View
HICSS
2002
IEEE
105views Biometrics» more  HICSS 2002»
15 years 2 months ago
Obtaining Language Models of Web Collections Using Query-Based Sampling Techniques
In the context of information retrieval, traditional collection selection algorithms have been widely studied. These algorithms utilize language models, a representation of the co...
Gary A. Monroe, James C. French, Allison L. Powell
TACAS
2010
Springer
342views Algorithms» more  TACAS 2010»
15 years 4 months ago
SAT Based Bounded Model Checking with Partial Order Semantics for Timed Automata
We study the model checking problem of timed automata based on SAT solving. Our work investigates alternative possibilities for coding the SAT reductions that are based on parallel...
Janusz Malinowski, Peter Niebert
62
Voted
KDD
2009
ACM
162views Data Mining» more  KDD 2009»
15 years 10 months ago
Augmenting the generalized hough transform to enable the mining of petroglyphs
Rock art is an archaeological term for human-made markings on stone. It is believed that there are millions of petroglyphs in North America alone, and the study of this valued cul...
Eamonn J. Keogh, Qiang Zhu 0002, Sang-Hee Lee, Xia...
SEMWEB
2010
Springer
14 years 7 months ago
SPARQL Query Optimization on Top of DHTs
We study the problem of SPARQL query optimization on top of distributed hash tables. Existing works on SPARQL query processing in such environments have never been implemented in a...
Zoi Kaoudi, Kostis Kyzirakos, Manolis Koubarakis
VLDB
2010
ACM
144views Database» more  VLDB 2010»
14 years 8 months ago
Methods for finding frequent items in data streams
The frequent items problem is to process a stream of items and find all items occurring more than a given fraction of the time. It is one of the most heavily studied problems in d...
Graham Cormode, Marios Hadjieleftheriou