Sciweavers

171 search results - page 16 / 35
» What's Decidable about Sequences
Sort
View
AAAI
2012
11 years 10 months ago
Dynamic Matching via Weighted Myopia with Application to Kidney Exchange
In many dynamic matching applications—especially high-stakes ones—the competitive ratios of prior-free online algorithms are unacceptably poor. The algorithm should take distr...
John P. Dickerson, Ariel D. Procaccia, Tuomas Sand...
WADS
2001
Springer
63views Algorithms» more  WADS 2001»
13 years 12 months ago
When Can You Fold a Map?
We explore the following problem: given a collection of creases on a piece of paper, each assigned a folding direction of mountain or valley, is there a flat folding by a sequenc...
Esther M. Arkin, Michael A. Bender, Erik D. Demain...
FGR
2002
IEEE
161views Biometrics» more  FGR 2002»
14 years 13 days ago
Baseline Results for the Challenge Problem of Human ID Using Gait Analysis
Identification of people from gait captured on video has become a challenge problem in computer vision. However, there is not a baseline algorithm or standard dataset for measuri...
P. Jonathon Phillips, Patrick Grother, Sudeep Sark...
IGPL
2008
124views more  IGPL 2008»
13 years 7 months ago
The Ricean Objection: An Analogue of Rice's Theorem for First-order Theories
We propose here an extension of Rice's Theorem to first-order logic, proven by totally elementary means. If P is any property defined over the collection of all first-order t...
Igor Carboni Oliveira, Walter Alexandre Carnielli
ICSE
2003
IEEE-ACM
14 years 7 months ago
Interaction Modeling as a Binding Thread in the Software Development Process
This paper proposes the use of an interaction modeling language called MoLIC to graphically represent scenarios as an additional resource in software development. MoLIC brings hum...
Maíra Greco de Paula, Simone Diniz Junqueir...