Sciweavers

1185 search results - page 48 / 237
» The Equivalence of Sampling and Searching
Sort
View
DAM
2008
115views more  DAM 2008»
13 years 7 months ago
Variable space search for graph coloring
Let G = (V, E) be a graph with vertex set V and edge set E. The k-coloring problem is to assign a color (a number chosen in {1, . . . , k}) to each vertex of G so that no edge has...
Alain Hertz, Matthieu Plumettaz, Nicolas Zufferey
ICC
2007
IEEE
116views Communications» more  ICC 2007»
14 years 2 months ago
Skip Tree Graph: a Distributed and Balanced Search Tree for Peer-to-Peer Networks
Abstract—Skip Tree Graph is a novel, distributed, data structure for peer-to-peer systems that supports exact-match and order-based queries such as range queries efficiently. It...
Alejandra González Beltrán, Paul Sag...
WEBDB
2010
Springer
167views Database» more  WEBDB 2010»
14 years 25 days ago
Tree patterns with Full Text Search
Tree patterns with full text search form the core of both XQuery Full Text and the NEXI query language. On such queries, users expect a relevance-ranked list of XML elements as an...
Maria-Hendrike Peetz, Maarten Marx
NLPRS
2001
Springer
14 years 6 days ago
Automatically Harvesting Katakana-English Term Pairs from Search Engine Query Logs
This paper describes a method of extracting katakana words and phrases, along with their English counterparts from non-aligned monolingual web search engine query logs. The method...
Eric Brill, Gary Kacmarcik, Chris Brockett
ICIP
2004
IEEE
14 years 9 months ago
Fast full search block motion estimation for H.264/AVC with multilevel successive elimination algorithm
We modify the multilevel successive elimination algorithm (MSEA) to make it compatible with the motion estimation required for the H.264/AVC video coding standard. The algorithm m...
Janne Heikkilä, Tuukka Toivonen