Sciweavers

8294 search results - page 279 / 1659
» Presenting Data from Experiments in Algorithmics
Sort
View
ICDE
2011
IEEE
233views Database» more  ICDE 2011»
14 years 10 months ago
Answering approximate string queries on large data sets using external memory
— An approximate string query is to find from a collection of strings those that are similar to a given query string. Answering such queries is important in many applications su...
Alexander Behm, Chen Li, Michael J. Carey
WACV
2002
IEEE
15 years 11 months ago
Optimal motion estimation from visual and inertial measurements
Cameras and inertial sensors are good candidates to be deployed together for autonomous vehicle motion estimation, since each can be used to resolve the ambiguities in the estimat...
Dennis Strelow, Sanjiv Singh
ICML
2010
IEEE
15 years 7 months ago
Active Learning for Networked Data
We introduce a novel active learning algorithm for classification of network data. In this setting, training instances are connected by a set of links to form a network, the label...
Mustafa Bilgic, Lilyana Mihalkova, Lise Getoor
CG
2007
Springer
15 years 6 months ago
Visualizing and animating the winged-edge data structure
The winged- and half- edge data structures are commonly used representations for polyhedron models. Due to the complexity, students in an introductory to computer graphics course ...
Bryan Neperud, John L. Lowther, Ching-Kuang Shene
CEC
2007
IEEE
15 years 10 months ago
Mining association rules from databases with continuous attributes using genetic network programming
Most association rule mining algorithms make use of discretization algorithms for handling continuous attributes. Discretization is a process of transforming a continuous attribute...
Karla Taboada, Eloy Gonzales, Kaoru Shimada, Shing...