Sciweavers

4190 search results - page 559 / 838
» The Cost of Design
Sort
View
EDBT
2010
ACM
181views Database» more  EDBT 2010»
15 years 5 months ago
Private record matching using differential privacy
Private matching between datasets owned by distinct parties is a challenging problem with several applications. Private matching allows two parties to identify the records that ar...
Ali Inan, Murat Kantarcioglu, Gabriel Ghinita, Eli...
NA
2010
85views more  NA 2010»
15 years 5 months ago
The reliability/cost trade-off for a class of ODE solvers
In the numerical solution of ODEs, it is now possible to develop efficient techniques that will deliver approximate solutions that are piecewise polynomials. The resulting methods...
Wayne H. Enright, Li Yan
WINET
2010
224views more  WINET 2010»
15 years 5 months ago
Hierarchical geographic multicast routing for wireless sensor networks
Wireless sensor networks comprise typically dense deployments of large networks of small wireless capable sensor devices. In such networks, multicast is a fundamental routing servi...
Dimitrios Koutsonikolas, Saumitra M. Das, Y. Charl...
ANCS
2009
ACM
15 years 4 months ago
SPC-FA: synergic parallel compact finite automaton to accelerate multi-string matching with low memory
Deterministic Finite Automaton (DFA) is well-known for its constant matching speed in worst case, and widely used in multistring matching, which is a critical technique in high pe...
Junchen Jiang, Yi Tang, Bin Liu, Xiaofei Wang, Yan...
ICETET
2009
IEEE
15 years 4 months ago
Face Description with Local Invariant Features: Application to Face Recognition
A completely automatic face recognition system is presented. The method works on color face images and localizes the face region from them initially. It then determines and select...
Sanjay A. Pardeshi, S. N. Talbar