Sciweavers

2985 search results - page 394 / 597
» Indexing Distributed Complex Data for Complex Queries
Sort
View
CGF
1999
125views more  CGF 1999»
15 years 6 months ago
Partitioning and Handling Massive Models for Interactive Collision Detection
We describe an approach for interactive collision detection and proximity computations on massive models composed of millions of geometric primitives. We address issues related to...
Andy Wilson, Eric Larsen, Dinesh Manocha, Ming C. ...
PVLDB
2010
83views more  PVLDB 2010»
15 years 4 months ago
Updatable and Evolvable Transforms for Virtual Databases
Applications typically have some local understanding of a database schema, a virtual database that may differ significantly from the actual schema of the data where it is stored...
James F. Terwilliger, Lois M. L. Delcambre, David ...
SISAP
2010
IEEE
243views Data Mining» more  SISAP 2010»
15 years 4 months ago
Similarity matrix compression for efficient signature quadratic form distance computation
Determining similarities among multimedia objects is a fundamental task in many content-based retrieval, analysis, mining, and exploration applications. Among state-of-the-art sim...
Christian Beecks, Merih Seran Uysal, Thomas Seidl
438
Voted
ACIIDS
2011
IEEE
209views Database» more  ACIIDS 2011»
15 years 1 months ago
Prototype of Object-Oriented Declarative Workflows
While in the traditional workflow processes the control flow is determined statically within process definitions, in declarative workflow processes the control flow is dynamic and ...
Marcin Dabrowski, Michal Drabik, Mariusz Trzaska, ...
ICDCS
2010
IEEE
15 years 10 months ago
Practical Robust Communication in DHTs Tolerating a Byzantine Adversary
—There are several analytical results on distributed hash tables (DHTs) that can tolerate Byzantine faults. Unfortunately, in such systems, operations such as data retrieval and ...
Maxwell Young, Aniket Kate, Ian Goldberg, Martin K...