Sciweavers

WISTP
2007
Springer
14 years 6 months ago
Linkability of Some Blind Signature Schemes
Unforgeability and blindness are two important properties of blind signature. The latter means that after interacting with various users, the signer is unable to link a valid messa...
Swee-Huay Heng, Wun-She Yap, Khoongming Khoo
WEA
2007
Springer
95views Algorithms» more  WEA 2007»
14 years 6 months ago
Experimental Evaluation of Parametric Max-Flow Algorithms
The parametric maximum flow problem is an extension of the classical maximum flow problem in which the capacities of certain arcs are not fixed but are functions of a single par...
Maxim A. Babenko, Jonathan Derryberry, Andrew V. G...
GFKL
2007
Springer
123views Data Mining» more  GFKL 2007»
14 years 6 months ago
Projecting Dialect Distances to Geography: Bootstrap Clustering vs. Noisy Clustering
Abstract. Dialectometry produces aggregate distance matrices in which a distance is specified for each pair of sites. By projecting groups obtained by clustering onto geography on...
John Nerbonne, Peter Kleiweg, Wilbert Heeringa, Fr...
ICC
2007
IEEE
14 years 6 months ago
IPACT with Smallest Available Report First: A New DBA Algorithm for EPON
—Dynamic Bandwidth allocation in Ethernet Passive Optical Networks (EPONs) has been an area of intense research in recent years. Most of the proposed solutions offer clever metho...
Swapnil Bhatia, Radim Bartos
KBSE
2009
IEEE
14 years 6 months ago
Evaluating the Accuracy of Fault Localization Techniques
—We investigate claims and assumptions made in several recent papers about fault localization (FL) techniques. Most of these claims have to do with evaluating FL accuracy. Our in...
Shaimaa Ali, James H. Andrews, Tamilselvi Dhandapa...
CCS
2009
ACM
14 years 6 months ago
Attacking cryptographic schemes based on "perturbation polynomials"
We show attacks on several cryptographic schemes that have recently been proposed for achieving various security goals in sensor networks. Roughly speaking, these schemes all use ...
Martin Albrecht, Craig Gentry, Shai Halevi, Jonath...
STOC
2003
ACM
152views Algorithms» more  STOC 2003»
15 years 4 days ago
Cell-probe lower bounds for the partial match problem
Given a database of n points in {0, 1}d, the partial match problem is: In response to a query x in {0, 1, }d, find a database point y such that for every i whenever xi = , we have...
T. S. Jayram, Subhash Khot, Ravi Kumar, Yuval Raba...
PODC
2009
ACM
15 years 12 days ago
Brief announcement: minimum spanning trees and cone-based topology control
Consider a setting where nodes can vary their transmission power thereby changing the network topology, the goal of topology control is to reduce the transmission power while ensu...
Alejandro Cornejo, Nancy A. Lynch
ECCV
2004
Springer
15 years 1 months ago
Unifying Approaches and Removing Unrealistic Assumptions in Shape from Shading: Mathematics Can Help
This article proposes a solution of the Lambertian Shape From Shading (SFS) problem by designing a new mathematical framework based on the notion of viscosity solutions. The power ...
Emmanuel Prados, Olivier D. Faugeras
ICCV
2007
IEEE
15 years 1 months ago
Learning 3-D Scene Structure from a Single Still Image
We consider the problem of estimating detailed 3-d structure from a single still image of an unstructured environment. Our goal is to create 3-d models which are both quantitative...
Ashutosh Saxena, Min Sun, Andrew Y. Ng