Sciweavers

2089 search results - page 131 / 418
» A New Problem in String Searching
Sort
View
SIGMETRICS
2010
ACM
213views Hardware» more  SIGMETRICS 2010»
15 years 2 months ago
Small subset queries and bloom filters using ternary associative memories, with applications
Associative memories offer high levels of parallelism in matching a query against stored entries. We design and analyze an architecture which uses a single lookup into a Ternary C...
Ashish Goel, Pankaj Gupta
DEDS
2008
87views more  DEDS 2008»
14 years 10 months ago
On-Line Monitoring of Large Petri Net Models Under Partial Observation
This paper deals with the on-line monitoring of large systems modeled as Petri Nets under partial observation. The plant observation is given by a subset of transitions whose occu...
George Jiroveanu, René K. Boel, Behzad Bord...
SIGIR
2009
ACM
15 years 4 months ago
Automatic URL completion and prediction using fuzzy type-ahead search
Type-ahead search is a new information-access paradigm, in which systems can find answers to keyword queries “onthe-fly” as a user types in a query. It improves traditional ...
Jiannan Wang, Guoliang Li, Jianhua Feng
FASE
2010
Springer
15 years 4 months ago
Why the Virtual Nature of Software Makes It Ideal for Search Based Optimization
This paper1 provides a motivation for the application of search based optimization to Software Engineering, an area that has come to be known as Search Based Software Engineering (...
Mark Harman
SPIRE
2005
Springer
15 years 3 months ago
Using the k-Nearest Neighbor Graph for Proximity Searching in Metric Spaces
Proximity searching consists in retrieving from a database, objects that are close to a query. For this type of searching problem, the most general model is the metric space, where...
Rodrigo Paredes, Edgar Chávez