Sciweavers

2519 search results - page 200 / 504
» cost 2007
Sort
View
APPROX
2007
Springer
67views Algorithms» more  APPROX 2007»
16 years 23 days ago
Maximum Gradient Embeddings and Monotone Clustering
abstract Manor Mendel1 and Assaf Naor2 1 The Open University of Israel 2 Courant Institute Let (X, dX ) be an n-point metric space. We show that there exists a distribution D over ...
Manor Mendel, Assaf Naor
ICDE
2007
IEEE
128views Database» more  ICDE 2007»
15 years 10 months ago
Realizing Privacy-Preserving Features in Hippocratic Databases
Preserving privacy has become a crucial requirement for operating a business that manages personal data. Hippocratic databases have been proposed to answer this requirement throug...
Yasin Laura-Silva, Walid G. Aref
DSN
2007
IEEE
16 years 28 days ago
Inherent Time Redundancy (ITR): Using Program Repetition for Low-Overhead Fault Tolerance
A new approach is proposed that exploits repetition inherent in programs to provide low-overhead transient fault protection in a processor. Programs repeatedly execute the same in...
Vimal K. Reddy, Eric Rotenberg
HPCC
2007
Springer
16 years 22 days ago
Maximum-Objective-Trust Clustering Solution and Analysis in Mobile Ad Hoc Networks
In mobile-AdHoc networks (MANETs), many applications need the support of layer-structure. Clustering solution is the most widely used layerstructure and the choosing of clusterhead...
Qiang Zhang, Guangming Hu, Zhenghu Gong
ATMOS
2007
183views Optimization» more  ATMOS 2007»
15 years 8 months ago
Solving Large Scale Crew Scheduling Problems by using Iterative Partitioning
This paper deals with large-scale crew scheduling problems arising at the Dutch railway operator, Netherlands Railways (NS). We discuss several methods to partition large instances...
Erwin J. W. Abbink, Joel Van't Wout, Dennis Huisma...