4850 search results - page 504 / 970 » Approximate Data Structures with Applications |
201
click to vote
CIKM
2005
Springer
16 years 1 months ago
2005
Springer
Testing reachability between nodes in a graph is a well-known problem with many important applications, including knowledge representation, program analysis, and more recently, bi...
214
click to vote
COMPUTER
2002
15 years 7 months ago
2002
rs use models or abstractions that hide low-level implementation details. Various kinds of representations such as data models, state-transition models, and dataflow models can hel...
215
click to vote
TOG
2002
15 years 7 months ago
2002
Rendering performance of consumer graphics hardware benefits from pre-processing geometric data into a form targeted to the underlying API and hardware. The various elements of ge...
220
click to vote
KDD
2012
ACM
13 years 10 months ago
2012
ACM
The problem of efficiently finding the best match for a query in a given set with respect to the Euclidean distance or the cosine similarity has been extensively studied. However...
198
click to vote
BMCBI
2005
15 years 7 months ago
2005
Background: Recognition codes for protein-DNA interactions typically assume that the interacting positions contribute additively to the binding energy. While this is known to not ...