Sciweavers

1984 search results - page 98 / 397
» The colourful feasibility problem
Sort
View
ICSE
2008
IEEE-ACM
14 years 10 months ago
Answering common questions about code
Difficulties understanding update paths while understanding code cause developers to waste time and insert bugs. A detailed investigation of these difficulties suggests that a wid...
Thomas D. LaToza
INFOCOM
2009
IEEE
14 years 4 months ago
A Theory of QoS for Wireless
—Wireless networks are increasingly used to carry applications with QoS constraints. Two problems arise when dealing with traffic with QoS constraints. One is admission control,...
I-Hong Hou, Vivek Borkar, P. R. Kumar
SIAMCOMP
2000
76views more  SIAMCOMP 2000»
13 years 9 months ago
On Interpolation and Automatization for Frege Systems
The interpolation method has been one of the main tools for proving lower bounds for propositional proof systems. Loosely speaking, if one can prove that a particular proof system ...
Maria Luisa Bonet, Toniann Pitassi, Ran Raz
CORR
2010
Springer
156views Education» more  CORR 2010»
13 years 8 months ago
Scheduling Periodic Real-Time Tasks with Heterogeneous Reward Requirements
—We study the problem of scheduling periodic real-time tasks which have individual minimum reward requirements. We consider situations where tasks generate jobs that can be provi...
I-Hong Hou, P. R. Kumar
CVPR
1999
IEEE
15 years 3 days ago
Fundamental Bounds on Edge Detection: An Information Theoretic Evaluation of Different Edge Cues
We treat the problem of edge detection as one of statistical inference. Local edge cues, implemented by filters, provide information about the likely positions of edges which can ...
Scott Konishi, Alan L. Yuille, James M. Coughlan, ...