6274 search results - page 697 / 1255 » From query complexity to computational complexity |
213
click to vote
ICCV
2005
IEEE
16 years 9 months ago
2005
IEEE
This paper presents a new surface content completion framework that can restore both shape and appearance from scanned, incomplete point set inputs. First, the geometric holes can...
169
click to vote
PLDI
2010
ACM
16 years 15 days ago
2010
ACM
Traditional data-oriented programming languages such as dataflow s and stream languages provide a natural abstraction for parallel programming. In these languages, a developer fo...
215
click to vote
BMCBI
2008
15 years 7 months ago
2008
Background: Graphs and networks are common analysis representations for biological systems. Many traditional graph algorithms such as k-clique, k-coloring, and subgraph matching h...
168
click to vote
SOUPS
2009
ACM
16 years 1 months ago
2009
ACM
Developments in ubiquitous and pervasive computing herald a future in which computation is embedded into our daily lives. Such a vision raises important questions about how people...
194
click to vote
GRID
2005
Springer
16 years 29 days ago
2005
Springer
— In a grid-computing environment, resource selection and scheduling depend on the network topology connecting the computation nodes. This paper presents a method to hierarchical...