Sciweavers

1376 search results - page 186 / 276
» Searching Trees: An Essay
Sort
View
CONSTRAINTS
2010
101views more  CONSTRAINTS 2010»
15 years 6 months ago
Constraint models for graceful graphs
Abstract. We present three constraint models of the problem of finding a graceful labelling of a graph, or proving that the graph is not graceful. An experimental comparison of the...
Barbara M. Smith, Jean-François Puget
IR
2008
15 years 6 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 6 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
TOG
2002
133views more  TOG 2002»
15 years 6 months ago
Interactive motion generation from examples
There are many applications that demand large quantities of natural looking motion. It is difficult to synthesize motion that looks natural, particularly when it is people who mus...
Okan Arikan, David A. Forsyth
CMOT
2010
176views more  CMOT 2010»
15 years 3 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