Sciweavers

32545 search results - page 30 / 6509
» Data Structures and Algorithms
Sort
View
INFORMATICALT
2002
82views more  INFORMATICALT 2002»
13 years 8 months ago
Data Aggregation Sets in Adaptive Data Model
This article presents the ways of identification, selection and transformation of the data into other structures. Relation selection and transformation may change data quantity and...
Petras Gailutis Adomenas, Algirdas Ciucelis
COCOON
1999
Springer
14 years 24 days ago
An External Memory Data Structure for Shortest Path Queries
We present results related to satisfying shortest path queries on a planar graph stored in external memory. Let N denote the number of vertices in the graph and let sort(N) denote...
David A. Hutchinson, Anil Maheshwari, Norbert Zeh
ML
2007
ACM
101views Machine Learning» more  ML 2007»
13 years 8 months ago
A persistent union-find data structure
The problem of disjoint sets, also known as union-find, consists in maintaining a partition of a finite set within a data structure. This structure provides two operations: a fu...
Sylvain Conchon, Jean-Christophe Filliâtre
GECCO
2009
Springer
204views Optimization» more  GECCO 2009»
14 years 1 months ago
Combined structure and motion extraction from visual data using evolutionary active learning
We present a novel stereo vision modeling framework that generates approximate, yet physically-plausible representations of objects rather than creating accurate models that are c...
Krishnanand N. Kaipa, Josh C. Bongard, Andrew N. M...
ICCV
2007
IEEE
14 years 2 months ago
Structure from Motion with Missing Data is NP-Hard
This paper shows that structure from motion is NP-hard for most sensible cost functions when missing data is allowed. The result provides a fundamental limitation of what is possi...
David Nistér, Fredrik Kahl, Henrik Stew&eac...