Sciweavers

3663 search results - page 474 / 733
» Problems in the ontology of computer programs
Sort
View
EMMCVPR
2005
Springer
16 years 5 days ago
Probabilistic Subgraph Matching Based on Convex Relaxation
We present a novel approach to the matching of subgraphs for object recognition in computer vision. Feature similarities between object model and scene graph are complemented with ...
Christian Schellewald, Christoph Schnörr
CINQ
2004
Springer
131views Database» more  CINQ 2004»
16 years 1 days ago
Model-Independent Bounding of the Supports of Boolean Formulae in Binary Data
Abstract. Data mining algorithms such as the Apriori method for finding frequent sets in sparse binary data can be used for efficient computation of a large number of summaries fr...
Artur Bykowski, Jouni K. Seppänen, Jaakko Hol...
CONCUR
2004
Springer
16 years 1 days ago
Open Maps, Alternating Simulations and Control Synthesis
Abstract. Control synthesis is slowly transcending its traditional application domain within engineering to find interesting and useful applications in computer science. Synthesis...
Paulo Tabuada
VTS
2003
IEEE
115views Hardware» more  VTS 2003»
15 years 12 months ago
Fault Testing for Reversible Circuits
Irreversible computation necessarily results in energy dissipation due to information loss. While small in comparison to the power consumption of today’s VLSI circuits, if curre...
Ketan N. Patel, John P. Hayes, Igor L. Markov
SPAA
2003
ACM
15 years 12 months ago
Throughput-centric routing algorithm design
The increasing application space of interconnection networks now encompasses several applications, such as packet routing and I/O interconnect, where the throughput of a routing a...
Brian Towles, William J. Dally, Stephen P. Boyd