Sciweavers

973 search results - page 175 / 195
» New Bounds on Crossing Numbers
Sort
View
STOC
2007
ACM
102views Algorithms» more  STOC 2007»
14 years 8 months ago
Zero-knowledge from secure multiparty computation
A zero-knowledge proof allows a prover to convince a verifier of an assertion without revealing any further information beyond the fact that the assertion is true. Secure multipar...
Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, A...
ISPD
2009
ACM
112views Hardware» more  ISPD 2009»
14 years 3 months ago
Post-floorplanning power/ground ring synthesis for multiple-supply-voltage designs
The multiple-supply voltage (MSV) design style has been extensively applied to mitigate dynamic-power consumption. The MSV design paradigm, however, brings many crucial challenges...
Wan-Ping Lee, Diana Marculescu, Yao-Wen Chang
INFOCOM
2008
IEEE
14 years 2 months ago
Joint Scheduling and Congestion Control in Mobile Ad-Hoc Networks
— In this paper we study the problem of jointly performing scheduling and congestion control in mobile adhoc networks so that network queues remain bounded and the resulting flo...
Umut Akyol, Matthew Andrews, Piyush Gupta, John D....
PODC
2006
ACM
14 years 2 months ago
Grouped distributed queues: distributed queue, proportional share multiprocessor scheduling
We present Grouped Distributed Queues (GDQ), the first proportional share scheduler for multiprocessor systems that scales well with a large number of processors and processes. G...
Bogdan Caprita, Jason Nieh, Clifford Stein
ICDM
2005
IEEE
166views Data Mining» more  ICDM 2005»
14 years 2 months ago
An Algorithm for In-Core Frequent Itemset Mining on Streaming Data
Frequent itemset mining is a core data mining operation and has been extensively studied over the last decade. This paper takes a new approach for this problem and makes two major...
Ruoming Jin, Gagan Agrawal