Sciweavers

451 search results - page 80 / 91
» On Parameterized Exponential Time Complexity
Sort
View
ICSE
2001
IEEE-ACM
14 years 2 months ago
A Web-Oriented Architectural Aspect for the Emerging Computational Tapestry
An emerging tapestry of computations will soon integrate systems around the globe. It will evolve without central control. Its complexity will be vast. We need new ideas, tools an...
Kevin J. Sullivan, Avneesh Saxena
PODS
1995
ACM
139views Database» more  PODS 1995»
14 years 1 months ago
Normalizing Incomplete Databases
Databases are often incomplete because of the presence of disjunctive information, due to con icts, partial knowledge and other reasons. Queries against such databases often ask q...
Leonid Libkin
ECCV
2002
Springer
14 years 12 months ago
Tracking and Rendering Using Dynamic Textures on Geometric Structure from Motion
Estimating geometric structure from uncalibrated images accurately enough for high quality rendering is difficult. We present a method where only coarse geometric structure is trac...
Dana Cobzas, Martin Jägersand
SBCCI
2003
ACM
129views VLSI» more  SBCCI 2003»
14 years 3 months ago
Hyperspectral Images Clustering on Reconfigurable Hardware Using the K-Means Algorithm
Unsupervised clustering is a powerful technique for understanding multispectral and hyperspectral images, being k-means one of the most used iterative approaches. It is a simple th...
Abel Guilhermino S. Filho, Alejandro César ...
PODC
2006
ACM
14 years 4 months ago
Computing separable functions via gossip
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
Damon Mosk-Aoyama, Devavrat Shah