Sciweavers

2376 search results - page 119 / 476
» More Efficient Internal-Regret-Minimizing Algorithms
Sort
View
BMVC
1998
13 years 9 months ago
Efficient Dense Matching for Textured Scenes using Region Growing
We present a simple and efficient dense matching method based on region growing techniques, which can be applied to a wide range of globally textured images like many outdoor scen...
Maxime Lhuillier
ENTCS
2006
137views more  ENTCS 2006»
13 years 7 months ago
An Efficient Method for Computing Exact State Space of Petri Nets With Stopwatches
In this paper, we address the issue of the formal verification of real-time systems in the context of a preemptive scheduling policy. We propose an algorithm which computes the st...
Morgan Magnin, Didier Lime, Olivier H. Roux
CVPR
2003
IEEE
14 years 10 months ago
Many-to-Many Graph Matching via Metric Embedding
Graph matching is an important component in many object recognition algorithms. Although most graph matching algorithms seek a one-to-one correspondence between nodes, it is often...
Yakov Keselman, Ali Shokoufandeh, M. Fatih Demirci...
ALMOB
2008
95views more  ALMOB 2008»
13 years 8 months ago
A stitch in time: Efficient computation of genomic DNA melting bubbles
Background: It is of biological interest to make genome-wide predictions of the locations of DNA melting bubbles using statistical mechanics models. Computationally, this poses th...
Eivind Tøstesen
DIALM
2004
ACM
161views Algorithms» more  DIALM 2004»
13 years 11 months ago
Batch conflict resolution algorithm with progressively accurate multiplicity estimation
The wireless connectivity, essential for pervasive computing, has ephemeral character and can be used for creating ad hoc networks, sensor networks, connection with RFID tags etc....
Petar Popovski, Frank H. P. Fitzek, Ramjee Prasad