Sciweavers

501 search results - page 81 / 101
» An Upper Bound on the Number of Rectangulations of a Point S...
Sort
View
JSYML
2008
74views more  JSYML 2008»
13 years 7 months ago
Omitting types for finite variable fragments and complete representations of algebras
. We give a novel application of algebraic logic to first order logic. A new, flexible construction is presented for representable but not completely representable atomic relation ...
Tarek Sayed Ahmed, Hajnal Andréka, Istv&aac...
TCOM
2008
151views more  TCOM 2008»
13 years 7 months ago
Low complexity MIMO scheduling with channel decomposition using capacity upperbound
Abstract In multiuser MIMO systems, the base station schedules transmissions to a group of users simultaneously. Since the data transmitted to each user are different, in order to ...
Xiaojie Zhang, Jungwoo Lee
ICCV
2009
IEEE
15 years 16 days ago
Time-Constrained Photography
Capturing multiple photos at different focus settings is a powerful approach for reducing optical blur, but how many photos should we capture within a fixed time budget? We develop...
Samuel W. Hasinoff, Kiriakos N. Kutulakos, Frédo ...
TON
2008
74views more  TON 2008»
13 years 7 months ago
Race conditions in coexisting overlay networks
By allowing end hosts to make independent routing decisions at the application level, different overlay networks may unintentionally interfere with each other. This paper describes...
Ram Keralapura, Chen-Nee Chuah, Nina Taft, Gianluc...
ALGOSENSORS
2008
Springer
13 years 9 months ago
Target Counting under Minimal Sensing: Complexity and Approximations
We consider the problem of counting a set of discrete point targets using a network of sensors under a minimalistic model. Each sensor outputs a single integer, the number of disti...
Sorabh Gandhi, Rajesh Kumar 0003, Subhash Suri