Sciweavers

4842 search results - page 350 / 969
» A Calculus for Data Mapping
Sort
View
SC
2004
ACM
16 years 3 days ago
A Peer-to-Peer Replica Location Service Based on a Distributed Hash Table
A Replica Location Service (RLS) allows registration and discovery of data replicas. In earlier work, we proposed an RLS framework and described the performance and scalability of...
Min Cai, Ann L. Chervenak, Martin R. Frank
WG
1999
Springer
15 years 11 months ago
Finding Smallest Supertrees Under Minor Containment
The diversity of application areas relying on tree-structured data results in wide interest in algorithms which determine differences or similarities among trees. One way of meas...
Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thi...
JCO
2007
123views more  JCO 2007»
15 years 6 months ago
On the number of local minima for the multidimensional assignment problem
The Multidimensional Assignment Problem (MAP) is an NP-hard combinatorial optimization problem occurring in many applications, such as data association, target tracking, and resou...
Don A. Grundel, Pavlo A. Krokhmal, Carlos A. S. Ol...
ICMCS
2009
IEEE
110views Multimedia» more  ICMCS 2009»
15 years 4 months ago
Visual content layer for scalable object recognition in urban image databases
Rich online map interaction represents a useful tool to get multimedia information related to physical places. With this type of systems, users can automatically compute the optim...
Xavier Baró, Sergio Escalera, Petia Radeva,...
CPM
2011
Springer
283views Combinatorics» more  CPM 2011»
14 years 10 months ago
Frequent Submap Discovery
Combinatorial maps are nice data structures for modeling the topology of nD objects subdivided in cells (e.g., vertices, edges, faces, volumes, ...) by means of incidence and adjac...
Stéphane Gosselin, Guillaume Damiand, Chris...