Sciweavers

1651 search results - page 233 / 331
» Measuring the Complexity of Classification Problems
Sort
View
GLOBECOM
2006
IEEE
14 years 2 months ago
Sensor Localization from WLS Optimization with Closed-form Gradient and Hessian
— A non-parametric, low-complexity algorithm for accurate and simultaneous localization of multiple sensors from scarce and imperfect ranging information is proposed. The techniq...
Giuseppe Destino, Giuseppe Thadeu Freitas de Abreu
ISM
2006
IEEE
209views Multimedia» more  ISM 2006»
14 years 2 months ago
Holistic Comparison of Text Images for Content-Based Retrieval
The accurate recognition of text that appears in images/videos using analytical character recognition methods is often very difficult, despite the fact that the text might be corr...
Julinda Gllavata, Ermir Qeli, Bernd Freisleben
SIGECOM
2005
ACM
122views ECommerce» more  SIGECOM 2005»
14 years 1 months ago
Multi-unit auctions with budget-constrained bidders
We study a multi-unit auction with multiple bidders, each of whom has a private valuation and a budget. The truthful mechanisms of such an auction are characterized, in the sense ...
Christian Borgs, Jennifer T. Chayes, Nicole Immorl...
DIS
2005
Springer
14 years 1 months ago
Practical Algorithms for Pattern Based Linear Regression
We consider the problem of discovering the optimal pattern from a set of strings and associated numeric attribute values. The goodness of a pattern is measured by the correlation b...
Hideo Bannai, Kohei Hatano, Shunsuke Inenaga, Masa...
VLDB
2005
ACM
114views Database» more  VLDB 2005»
14 years 1 months ago
Checking for k-Anonymity Violation by Views
When a private relational table is published using views, secrecy or privacy may be violated. This paper uses a formally-defined notion of k-anonymity to measure disclosure by vi...
Chao Yao, Xiaoyang Sean Wang, Sushil Jajodia