Sciweavers

893 search results - page 175 / 179
» P3C: A New Algorithm for the Simple Temporal Problem
Sort
View
INFOCOM
2000
IEEE
14 years 1 hour ago
Fair Bandwidth Sharing Among Virtual Networks: A Capacity Resizing Approach
Abstract—Virtual Private Networks (VPN) and link sharing are cost effective way of realizing corporate intranets. Corporate intranets will increasingly have to provide Integrated...
Rahul Garg, Huzur Saran
STOC
1993
ACM
134views Algorithms» more  STOC 1993»
13 years 11 months ago
Quantum complexity theory
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s...
Ethan Bernstein, Umesh V. Vazirani
CLEF
2009
Springer
13 years 8 months ago
UNIBA-SENSE @ CLEF 2009: Robust WSD Task
This paper presents the participation of the semantic N-levels search engine SENSE at the CLEF 2009 Ad Hoc Robust-WSD Task. During the participation at the same task of CLEF 2008,...
Pierpaolo Basile, Annalina Caputo, Giovanni Semera...
ECCC
2007
86views more  ECCC 2007»
13 years 7 months ago
Testing Halfspaces
This paper addresses the problem of testing whether a Boolean-valued function f is a halfspace, i.e. a function of the form f(x) = sgn(w·x−θ). We consider halfspaces over the ...
Kevin Matulef, Ryan O'Donnell, Ronitt Rubinfeld, R...
VLDB
2007
ACM
126views Database» more  VLDB 2007»
14 years 7 months ago
Querying Complex Structured Databases
Correctly generating a structured query (e.g., an XQuery or a SQL query) requires the user to have a full understanding of the database schema, which can be a daunting task. Alter...
Cong Yu, H. V. Jagadish