Sciweavers

3244 search results - page 231 / 649
» On convex complexity measures
Sort
View
INDOCRYPT
2004
Springer
15 years 12 months ago
Information Theory and the Security of Binary Data Perturbation
Random data perturbation (RDP) has been in use for several years in statistical databases and public surveys as a means of providing privacy to individuals while collecting informa...
Poorvi L. Vora
ADC
2003
Springer
133views Database» more  ADC 2003»
15 years 11 months ago
Utilizing Hyperlink Transitivity to Improve Web Page Clustering
The rapid increase of web complexity and size makes web searched results far from satisfaction in many cases due to a huge amount of information returned by search engines. How to...
Jingyu Hou, Yanchun Zhang
DATE
2010
IEEE
148views Hardware» more  DATE 2010»
15 years 11 months ago
DVFS based task scheduling in a harvesting WSN for Structural Health Monitoring
— The task scheduler of an energy harvesting wireless sensor node (WSN) must adapt the task complexity and maximize the accuracy of the tasks within the constraint of limited ene...
A. Ravinagarajan, D. Dondi, Tajana Simunic Rosing
ISCAS
2002
IEEE
141views Hardware» more  ISCAS 2002»
15 years 11 months ago
Power characterization of digital filters implemented on FPGA
The evaluation of power consumption in complex digital systems is a hard task that normally requires long simulation time and complicated models. In this work, we obtain power con...
Gian-Carlo Cardarilli, Andrea Del Re, Alberto Nann...
FOCS
2000
IEEE
15 years 11 months ago
On Clusterings - Good, Bad and Spectral
We motivate and develop a natural bicriteria measure for assessing the quality of a clustering that avoids the drawbacks of existing measures. A simple recursive heuristic is shown...
Ravi Kannan, Santosh Vempala, Adrian Vetta