Sciweavers

2543 search results - page 375 / 509
» Optimal Ordered Problem Solver
Sort
View
PAMI
2012
13 years 4 months ago
Aggregating Local Image Descriptors into Compact Codes
— This paper addresses the problem of large-scale image search. Three constraints have to be taken into account: search accuracy, efficiency, and memory usage. We first present...
Hervé Jégou, Florent Perronnin, Matt...
212
Voted
POPL
2003
ACM
16 years 2 months ago
New results on the computability and complexity of points - to analysis
Given a program and two variables p and q, the goal of points-to analysis is to check if p can point to q in some execution of the program. This well-studied problem plays a cruci...
Venkatesan T. Chakaravarthy
ICS
2005
Tsinghua U.
15 years 7 months ago
Continuous Replica Placement schemes in distributed systems
The Replica Placement Problem (RPP) aims at creating a set of duplicated data objects across the nodes of a distributed system in order to optimize certain criteria. Typically, RP...
Thanasis Loukopoulos, Petros Lampsas, Ishfaq Ahmad
COMCOM
2006
168views more  COMCOM 2006»
15 years 2 months ago
Relay node placement in large scale wireless sensor networks
Scalability and extended lifetime are two critical design goals of any large scale wireless sensor network. A two-tiered network model has been proposed recently for this purpose....
Jian Tang, Bin Hao, Arunabha Sen
TPDS
1998
92views more  TPDS 1998»
15 years 2 months ago
An Efficient Algorithm for Row Minima Computations on Basic Reconfigurable Meshes
—A matrix A of size m œ n containing items from a totally ordered universe is termed monotone if, for every i, j, 1 ‹ i < j ‹ m, the minimum value in row j lies below or to...
Koji Nakano, Stephan Olariu