Sciweavers

493 search results - page 65 / 99
» Quantum Query Complexity of Some Graph Problems
Sort
View
SIGMOD
2008
ACM
167views Database» more  SIGMOD 2008»
15 years 9 months ago
Efficient lineage tracking for scientific workflows
Data lineage and data provenance are key to the management of scientific data. Not knowing the exact provenance and processing pipeline used to produce a derived data set often re...
Thomas Heinis, Gustavo Alonso
JGT
2007
99views more  JGT 2007»
14 years 9 months ago
Backbone colorings for graphs: Tree and path backbones
We introduce and study backbone colorings, a variation on classical vertex colorings: Given a graph G = (V, E) and a spanning subgraph H of G (the backbone of G), a backbone color...
Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, G...
MOBICOM
2010
ACM
14 years 10 months ago
Differential forms for target tracking and aggregate queries in distributed networks
Consider mobile targets moving in a plane and their movements being monitored by a network such as a field of sensors. We develop distributed algorithms for in-network tracking an...
Rik Sarkar, Jie Gao
AAAI
2007
15 years 18 hour ago
Logical Generative Models for Probabilistic Reasoning about Existence, Roles and Identity
In probabilistic reasoning, the problems of existence and identity are important to many different queries; for example, the probability that something that fits some description...
David Poole
GECCO
2004
Springer
211views Optimization» more  GECCO 2004»
15 years 3 months ago
Node-Depth Encoding for Evolutionary Algorithms Applied to Network Design
Network design involves several areas of engineering and science. Computer networks, electrical circuits, transportation problems, and phylogenetic trees are some examples. In gene...
Alexandre C. B. Delbem, André Carlos Ponce ...