Sciweavers

435 search results - page 10 / 87
» Partitioning Search Spaces of a Randomized Search
Sort
View
TSP
2010
14 years 4 months ago
Low-complexity decoding via reduced dimension maximum-likelihood search
In this paper, we consider a low-complexity detection technique referred to as a reduced dimension maximum-likelihood search (RD-MLS). RD-MLS is based on a partitioned search which...
Jun Won Choi, Byonghyo Shim, Andrew C. Singer, Nam...
VLDB
1991
ACM
134views Database» more  VLDB 1991»
15 years 1 months ago
Extending the Search Strategy in a Query Optimizer
In order to cope efficiently with simple or complex queries as well as different application requirements (e.g., ad-hoc versus repetitive queries), a query optimizer ought to supp...
Rosana S. G. Lanzelotte, Patrick Valduriez
SPIN
2004
Springer
15 years 3 months ago
Explicit State Model Checking with Hopper
The Murϕ-based Hopper tool is a general purpose explicit model checker. Hopper leverages Murϕ’s class structure to implement new algorithms. Hopper differs from Murϕ in that i...
Michael Jones, Eric Mercer
ESA
2009
Springer
149views Algorithms» more  ESA 2009»
15 years 4 months ago
Sparse Cut Projections in Graph Streams
Finding sparse cuts is an important tool for analyzing large graphs that arise in practice, such as the web graph, online social communities, and VLSI circuits. When dealing with s...
Atish Das Sarma, Sreenivas Gollapudi, Rina Panigra...
ICDE
2006
IEEE
98views Database» more  ICDE 2006»
15 years 11 months ago
Space-Partitioning Trees in PostgreSQL: Realization and Performance
Many evolving database applications warrant the use of non-traditional indexing mechanisms beyond B+-trees and hash tables. SP-GiST is an extensible indexing framework that broade...
Mohamed Y. Eltabakh, Ramy Eltarras, Walid G. Aref