Sciweavers

189 search results - page 5 / 38
» Making a case for a Green500 list
Sort
View
JSAT
2008
122views more  JSAT 2008»
13 years 7 months ago
SAT Algorithms for Colouring Some Special Classes of Graphs: Some Theoretical and Experimental Results
The local search algorithm GSAT is based on the notion of Satisfiability. It has been used successfully for colouring graphs, solving instances of the 3SAT problem, planning block...
Sriyankar Acharyya
SIGIR
2011
ACM
12 years 10 months ago
Faster top-k document retrieval using block-max indexes
Large search engines process thousands of queries per second over billions of documents, making query processing a major performance bottleneck. An important class of optimization...
Shuai Ding, Torsten Suel
ENTCS
2002
90views more  ENTCS 2002»
13 years 7 months ago
Inorder traversal of splay trees
Splay trees, a form of self-adjusting binary tree, were introduced by Sleator and Tarjan in the early 1980s. Their main use is to store ordered lists. The idea is to keep the tree...
Colm Ó'Dúnlaing
SIGMOD
2012
ACM
230views Database» more  SIGMOD 2012»
11 years 10 months ago
Pay-as-you-go data integration for linked data: opportunities, challenges and architectures
Linked Data (LD) provides principles for publishing data that underpin the development of an emerging web of data. LD follows the web in providing low barriers to entry: publisher...
Norman W. Paton, Klitos Christodoulou, Alvaro A. A...
LREC
2010
155views Education» more  LREC 2010»
13 years 6 months ago
Virtual Language Observatory: The Portal to the Language Resources and Technology Universe
Over the years, the field of Language Resources and Technology (LRT) has developed a tremendous amount of resources and tools. However, there is no ready-to-use map that researche...
Dieter Van Uytvanck, Claus Zinn, Daan Broeder, Pet...