Sciweavers

1458 search results - page 256 / 292
» Practical Preference Relations for Large Data Sets
Sort
View
SIGMOD
2010
ACM
364views Database» more  SIGMOD 2010»
15 years 4 months ago
Optimizing schema-last tuple-store queries in graphd
Current relational databases require that a database schema exist prior to data entry and require manual optimization for best performance. We describe the query optimization tech...
Scott M. Meyer, Jutta Degener, John Giannandrea, B...
RTA
1995
Springer
15 years 3 months ago
Completion for Multiple Reduction Orderings
We present a completion procedure (called MKB) that works for multiple reduction orderings. Given equations and a set of reduction orderings, the procedure simulates a computation ...
Masahito Kurihara, Hisashi Kondo, Azuma Ohuchi
CIARP
2009
Springer
15 years 3 months ago
A Brief Index for Proximity Searching
A large number of computer tasks can be modeled as the search for an object near a given query. From multimedia databases to learning algorithms, data mining and pattern recognitio...
Eric Sadit Tellez, Edgar Chávez, Antonio Ca...
LWA
2007
15 years 1 months ago
Know the Right People? Recommender Systems for Web 2.0
Web 2.0 applications like Flickr, YouTube, or Del.icio.us are increasingly popular online communities for creating, editing and sharing content. However, the rapid increase in siz...
Stefan Siersdorfer, Sergej Sizov, Paul Clough
NAACL
2007
15 years 1 months ago
Unsupervised Natural Language Processing Using Graph Models
In the past, NLP has always been based on the explicit or implicit use of linguistic knowledge. In classical computer linguistic applications explicit rule based approaches prevai...
Chris Biemann