Sciweavers

1041 search results - page 126 / 209
» Randomizing Reductions of Search Problems
Sort
View
SPIRE
2010
Springer
13 years 6 months ago
Hypergeometric Language Model and Zipf-Like Scoring Function for Web Document Similarity Retrieval
The retrieval of similar documents in the Web from a given document is different in many aspects from information retrieval based on queries generated by regular search engine use...
Felipe Bravo-Marquez, Gaston L'Huillier, Sebasti&a...
VLDB
2007
ACM
103views Database» more  VLDB 2007»
14 years 8 months ago
On the Production of Anorexic Plan Diagrams
A "plan diagram" is a pictorial enumeration of the execution plan choices of a database query optimizer over the relational selectivity space. We have shown recently tha...
Harish D., Pooja N. Darera, Jayant R. Haritsa
JELIA
2004
Springer
14 years 1 months ago
tascpl: TAS Solver for Classical Propositional Logic
We briefly overview the most recent improvements we have incorporated to the existent implementations of the TAS methodology, the simplified ∆-tree representation of formulas i...
Manuel Ojeda-Aciego, Agustín Valverde
ICCV
2009
IEEE
15 years 25 days ago
Higher-Order Gradient Descent by Fusion-Move Graph Cut
Markov Random Field is now ubiquitous in many formulations of various vision problems. Recently, optimization of higher-order potentials became practical using higherorder graph...
Hiroshi Ishikawa
PARA
2004
Springer
14 years 1 months ago
Speeding up Parallel Graph Coloring
Abstract. This paper presents new efficient parallel algorithms for finding approximate solutions to graph coloring problems. We consider an existing shared memory parallel graph...
Assefaw Hadish Gebremedhin, Fredrik Manne, Tom Woo...