Sciweavers

1521 search results - page 159 / 305
» The Stardinates - Visualizing Highly Structured Data
Sort
View
121
Voted
SI3D
2005
ACM
15 years 9 months ago
Broad-phase collision detection using semi-adjusting BSP-trees
The broad-phase step of collision detection in scenes composed of n moving objects is a challenging problem because enumerating collision pairs has an inherent O(n2) complexity. S...
Rodrigo G. Luque, João Luiz Dihl Comba, Car...
139
Voted
BTW
2003
Springer
94views Database» more  BTW 2003»
15 years 9 months ago
The Paradigm of Relational Indexing: a Survey
Abstract: In order to achieve efficient execution plans for queries comprising userdefined data types and predicates, the database system has to be provided with appropriate index ...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...
111
Voted
CIDM
2007
IEEE
15 years 7 months ago
Efficient Kernel-based Learning for Trees
Kernel methods are effective approaches to the modeling of structured objects in learning algorithms. Their major drawback is the typically high computational complexity of kernel ...
Fabio Aiolli, Giovanni Da San Martino, Alessandro ...
125
Voted
RECOMB
2010
Springer
15 years 7 months ago
MoGUL: Detecting Common Insertions and Deletions in a Population
Abstract. While the discovery of structural variants in the human population is ongoing, most methods for this task assume that the genome is sequenced to high coverage (e.g. 40x),...
Seunghak Lee, Eric Xing, Michael Brudno
146
Voted
CHI
2005
ACM
15 years 5 months ago
Why use memo for all?: restructuring mobile applications to support informal note taking
Informal note taking is an essential activity in Personal Information Management (PIM). Most mobile devices support this via a suite of applications, employing both highly structu...
Liwei Dai, Wayne G. Lutters, Carlie Bower