Sciweavers

1058 search results - page 126 / 212
» It's Doomed; We Can Prove It
Sort
View
MOR
2007
100views more  MOR 2007»
13 years 9 months ago
On Scheduling Fees to Prevent Merging, Splitting, and Transferring of Jobs
A deterministic server is shared by users with identical linear waiting costs, requesting jobs of arbitrary lengths. Shortest jobs are served first for efficiency. The server can...
Hervé Moulin
EJWCN
2010
118views more  EJWCN 2010»
13 years 4 months ago
Controlled Delegation Protocol in Mobile RFID Networks
To achieve off-line delegation for mobile readers, we propose a delegation protocol for mobile RFID allowing its readers access to specific tags through back-end server. That is t...
Ming-Hour Yang
CORR
2002
Springer
141views Education» more  CORR 2002»
13 years 9 months ago
Question answering: from partitions to Prolog
Abstract. We implement Groenendijk and Stokhof's partition semantics of questions in a simple question answering algorithm. The algorithm is sound, complete, and based on tabl...
Balder ten Cate, Chung-chieh Shan
STOC
2009
ACM
152views Algorithms» more  STOC 2009»
14 years 4 months ago
Green's conjecture and testing linear-invariant properties
A system of linear equations in p unknowns Mx = b is said to have the removal property if every set S ⊆ {1, . . . , n} which contains o(np− ) solutions of Mx = b can be turned...
Asaf Shapira
COMPGEOM
2004
ACM
14 years 3 months ago
Single-strip triangulation of manifolds with arbitrary topology
Triangle strips have been widely used for efficient rendering. It is NP-complete to test whether a given triangulated model can be represented as a single triangle strip, so many...
David Eppstein, M. Gopi