Sciweavers

190 search results - page 17 / 38
» A Simple Proof Technique for Certain Parametricity Results
Sort
View
PPDP
2009
Springer
14 years 2 months ago
Reasoning with hypothetical judgments and open terms in hybrid
Hybrid is a system developed to specify and reason about logics, programming languages, and other formal systems expressed in rder abstract syntax (HOAS). An important goal of Hyb...
Amy P. Felty, Alberto Momigliano
TIM
2011
151views more  TIM 2011»
13 years 2 months ago
IIR Filter Models of Haptic Vibration Textures
—Haptic tactile feedback is a widely used and effective technique in virtual reality applications. When an object’s surface is explored by stroking it using fingers, finger n...
Vijaya Lakshmi Guruswamy, Jochen Lang, Won-Sook Le...
MOBIHOC
2009
ACM
14 years 8 months ago
Improved bounds on the throughput efficiency of greedy maximal scheduling in wireless networks
Due to its low complexity, Greedy Maximal Scheduling (GMS), also known as Longest Queue First (LQF), has been studied extensively for wireless networks. However, GMS can result in...
Mathieu Leconte, Jian Ni, Rayadurgam Srikant
SIAMCOMP
2000
104views more  SIAMCOMP 2000»
13 years 7 months ago
On the Difficulty of Designing Good Classifiers
We consider the problem of designing a near-optimal linear decision tree to classify two given point sets B and W in n. A linear decision tree de nes a polyhedral subdivision of sp...
Michelangelo Grigni, Vincent Mirelli, Christos H. ...
CPAIOR
2009
Springer
14 years 2 months ago
Learning How to Propagate Using Random Probing
Abstract. In constraint programming there are often many choices regarding the propagation method to be used on the constraints of a problem. However, simple constraint solvers usu...
Efstathios Stamatatos, Kostas Stergiou