Sciweavers

350 search results - page 47 / 70
» Lower bounds and heuristic algorithms for the k
Sort
View
STOC
2006
ACM
121views Algorithms» more  STOC 2006»
15 years 3 months ago
On adequate performance measures for paging
Memory management is a fundamental problem in computer architecture and operating systems. We consider a two-level memory system with fast, but small cache and slow, but large mai...
Konstantinos Panagiotou, Alexander Souza
ALT
1999
Springer
15 years 1 months ago
Extended Stochastic Complexity and Minimax Relative Loss Analysis
We are concerned with the problem of sequential prediction using a givenhypothesis class of continuously-manyprediction strategies. An e ectiveperformance measure is the minimax re...
Kenji Yamanishi
COMPGEOM
2010
ACM
15 years 2 months ago
Incidences in three dimensions and distinct distances in the plane
d Abstract] György Elekes Eötvös University Micha Sharir Tel Aviv University and New York University We first describe a reduction from the problem of lower-bounding the numbe...
György Elekes, Micha Sharir
MOBIHOC
2008
ACM
15 years 9 months ago
Multicast capacity for hybrid wireless networks
We study the multicast capacity of a random wireless network consisting of ordinary wireless nodes and base stations, known as a hybrid network. Assume that n ordinary wireless no...
XuFei Mao, Xiang-Yang Li, ShaoJie Tang
CVPR
2008
IEEE
1042views Computer Vision» more  CVPR 2008»
15 years 11 months ago
Graph cut based image segmentation with connectivity priors
Graph cut is a popular technique for interactive image segmentation. However, it has certain shortcomings. In particular, graph cut has problems with segmenting thin elongated obj...
Sara Vicente, Vladimir Kolmogorov, Carsten Rother