Sciweavers

520 search results - page 89 / 104
» Reductions Between Expansion Problems
Sort
View
TCC
2007
Springer
170views Cryptology» more  TCC 2007»
14 years 2 months ago
Secure Linear Algebra Using Linearly Recurrent Sequences
In this work we present secure two-party protocols for various core problems in linear algebra. Our main result is a protocol to obliviously decide singularity of an encrypted matr...
Eike Kiltz, Payman Mohassel, Enav Weinreb, Matthew...
IPSN
2004
Springer
14 years 2 months ago
Distributed optimization in sensor networks
Wireless sensor networks are capable of collecting an enormous amount of data over space and time. Often, the ultimate objective is to derive an estimate of a parameter or functio...
Michael Rabbat, Robert D. Nowak
GD
2003
Springer
14 years 1 months ago
Fixed-Location Circular-Arc Drawing of Planar Graphs
In this paper we consider the problem of drawing a planar graph using circular arcs as edges, given a one-to-one mapping between the vertices of the graph and a set of points in t...
Alon Efrat, Cesim Erten, Stephen G. Kobourov
ICCAD
1999
IEEE
86views Hardware» more  ICCAD 1999»
14 years 1 months ago
Clock skew scheduling for improved reliability via quadratic programming
This paper considers the problem of determining an optimal clock skew schedule for a synchronous VLSI circuit. A novel formulation of clock skew scheduling as a constrained quadrat...
Ivan S. Kourtev, Eby G. Friedman
KDD
2000
ACM
149views Data Mining» more  KDD 2000»
14 years 9 days ago
Efficient clustering of high-dimensional data sets with application to reference matching
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...
Andrew McCallum, Kamal Nigam, Lyle H. Ungar