Sciweavers

4908 search results - page 351 / 982
» On the Complexity of Optimal K-Anonymity
Sort
View
INFOCOM
2008
IEEE
16 years 1 months ago
Maximizing Resilient Throughput in Peer-to-Peer Network: A Generalized Flow Approach
—A unique challenge in P2P network is that the peer dynamics (departure or failure) cause unavoidable disruption to the downstream peers. While many works have been dedicated to ...
Bin Chang, Yi Cui, Yuan Xue
EAGC
2004
Springer
16 years 5 days ago
A Grid-Enabled Adaptive Problem Solving Environment
AS complexity of computational applications and their environments has been increased due to the heterogeneity of resources; complexity, continuous changes of the applications as w...
Yoonhee Kim, Ilkyeun Ra, Salim Hariri, Yangwoo Kim
HICSS
2003
IEEE
99views Biometrics» more  HICSS 2003»
16 years 2 days ago
Towards Feasible Topology Formation Algorithms for Bluetooth-based WPANs
In this paper, we tackle the problem of topology formation in Bluetooth Wireless Personal Area Networks (BTWPANs). We first overview and extend a previously proposed centralized ...
Carla-Fabiana Chiasserini, Marco Ajmone Marsan, El...
VLDB
1997
ACM
124views Database» more  VLDB 1997»
15 years 11 months ago
An Efficient Cost-Driven Index Selection Tool for Microsoft SQL Server
In this paper we describe novel techniques that make it possible to build an industrial-strength tool for automating the choice of indexes in the physical design of a SQL database...
Surajit Chaudhuri, Vivek R. Narasayya
ICPR
2010
IEEE
15 years 9 months ago
Fast Training of Object Detection Using Stochastic Gradient Descent
Training datasets for object detection problems are typically very large and Support Vector Machine (SVM) implementations are computationally complex. As opposed to these complex ...
Rob Wijnhoven, Peter H. N. De With