Sciweavers

1568 search results - page 150 / 314
» The problem of examination questions in algorithmics
Sort
View
CPM
2000
Springer
105views Combinatorics» more  CPM 2000»
15 years 9 months ago
Structural Properties and Tractability Results for Linear Synteny
The syntenic dista nce between two species is the minimum number of fusions, fissions, and translocations required to transform one genome into the other. The linear syntenic dis...
David Liben-Nowell, Jon M. Kleinberg
ADHOC
2007
101views more  ADHOC 2007»
15 years 4 months ago
Searching strategies for target discovery in wireless networks
— In this paper, we address a fundamental problem concerning the optimal searching strategy in terms of searching cost for the target discovery problem in wireless networks. In o...
Zhao Cheng, Wendi B. Heinzelman
AAAI
2006
15 years 6 months ago
Model-Based Collaborative Filtering as a Defense against Profile Injection Attacks
The open nature of collaborative recommender systems allows attackers who inject biased profile data to have a significant impact on the recommendations produced. Standard memory-...
Bamshad Mobasher, Robin D. Burke, Jeff J. Sandvig
COMPGEOM
2006
ACM
15 years 10 months ago
Embedding ultrametrics into low-dimensional spaces
We study the problem of minimum-distortion embedding of ultrametrics into the plane and higher dimensional spaces. Ultrametrics are a natural class of metrics that frequently occu...
Mihai Badoiu, Julia Chuzhoy, Piotr Indyk, Anastasi...
ECCV
2002
Springer
16 years 6 months ago
Finding the Largest Unambiguous Component of Stereo Matching
Abstract. Stereo matching is an ill-posed problem for at least two principal reasons: (1) because of the random nature of match similarity measure and (2) because of structural amb...
Radim Sára