Sciweavers

3055 search results - page 401 / 611
» Randomized Search Trees
Sort
View
IR
2008
15 years 4 months ago
A compressed self-index using a Ziv-Lempel dictionary
A compressed full-text self-index for a text T , of size u, is a data structure used to search for patterns P, of size m, in T , that requires reduced space, i.e. space that depend...
Luís M. S. Russo, Arlindo L. Oliveira
COMCOM
2004
149views more  COMCOM 2004»
15 years 3 months ago
Accelerating network security services with fast packet classification
To protect a network, secure network systems such as intrusion detection system (IDS) and firewall are often installed to control or monitor network traffic. These systems often i...
Shiuh-Pyng Shieh, Fu-Yuan Lee, Ya-Wen Lin
CMOT
2010
176views more  CMOT 2010»
15 years 1 months ago
A cognitive model of spatial path-planning
Planning a path to a destination, given a number of options and obstacles, is a common task. We suggest a two-component cognitive model that combines retrieval of knowledge about t...
David Reitter, Christian Lebiere
JAIR
2011
123views more  JAIR 2011»
14 years 11 months ago
The Complexity of Integer Bound Propagation
Bound propagation is an important Artificial Intelligence technique used in Constraint Programming tools to deal with numerical constraints. It is typically embedded within a sea...
Lucas Bordeaux, George Katsirelos, Nina Narodytska...
CPAIOR
2011
Springer
14 years 7 months ago
Almost Square Packing
Abstract. The almost square rectangle packing problem involves packing all rectangles with sizes 1 × 2 to n × (n + 1) (almost squares) into an enclosing rectangle of minimal area...
Helmut Simonis, Barry O'Sullivan