Sciweavers

2570 search results - page 463 / 514
» Fast Algorithms For The Computation Of Ranklets
Sort
View
ICMCS
2006
IEEE
371views Multimedia» more  ICMCS 2006»
15 years 4 months ago
Automatic Counting of Interacting People by using a Single Uncalibrated Camera
Automatic counting of people, entering or exiting a region of interest, is very important for both business and security applications. This paper introduces an automatic and robus...
Senem Velipasalar, Ying-li Tian, Arun Hampapur
PLDI
2006
ACM
15 years 3 months ago
A global progressive register allocator
This paper describes a global progressive register allocator, a register allocator that uses an expressive model of the register allocation problem to quickly find a good allocat...
David Ryan Koes, Seth Copen Goldstein
GLVLSI
2005
IEEE
85views VLSI» more  GLVLSI 2005»
15 years 3 months ago
Utilizing don't care states in SAT-based bounded sequential problems
Boolean Satisfiability (SAT) solvers are popular engines used throughout the verification world. Bounded sequential problems such as bounded model checking and bounded sequentia...
Sean Safarpour, Görschwin Fey, Andreas G. Ven...
GRAPHITE
2005
ACM
15 years 3 months ago
View-dependent tetrahedral meshing and rendering
We present a meshing and rendering framework for tetrahedral meshes that constructs a multi-resolution representation and uses this representation to adapt the mesh to rendering p...
Ralf Sondershaus, Wolfgang Straßer
ATVA
2005
Springer
132views Hardware» more  ATVA 2005»
15 years 3 months ago
Flat Counter Automata Almost Everywhere!
Abstract. This paper argues that flatness appears as a central notion in the verification of counter automata. A counter automaton is called flat when its control graph can be ...
Jérôme Leroux, Grégoire Sutre