Sciweavers

1289 search results - page 58 / 258
» Complexity of Counting the Optimal Solutions
Sort
View
SIGMOD
1998
ACM
143views Database» more  SIGMOD 1998»
15 years 2 months ago
Optimal Multi-Step k-Nearest Neighbor Search
For an increasing number of modern database applications, efficient support of similarity search becomes an important task. Along with the complexity of the objects such as images...
Thomas Seidl, Hans-Peter Kriegel
BROADNETS
2007
IEEE
15 years 4 months ago
Cross-layer optimization made practical
Abstract— Limited resources and time-varying nature of wireless ad hoc networks demand optimized use of resources across layers. Cross-layer optimization (CLO) for wireless netwo...
Ajit Warrier, Long Le, Injong Rhee
ICDE
2009
IEEE
126views Database» more  ICDE 2009»
15 years 4 months ago
Instant Advertising in Mobile Peer-to-Peer Networks
— To explore the benefit of advertising instant and location-aware commercials that can not be effectively promoted by traditional medium like TV program and Internet, we propos...
Zaiben Chen, Heng Tao Shen, Quanqing Xu, Xiaofang ...
FUN
2010
Springer
293views Algorithms» more  FUN 2010»
15 years 2 months ago
Computational Complexity of Two-Dimensional Platform Games
Abstract. We analyze the computational complexity of various twodimensional platform games. We identify common properties of these games that allow us to state several meta-theorem...
Michal Forisek
DAC
2009
ACM
15 years 10 months ago
Handling complexities in modern large-scale mixed-size placement
In this paper, we propose an effective algorithm flow to handle largescale mixed-size placement. The basic idea is to use floorplanning to guide the placement of objects at the gl...
Jackey Z. Yan, Natarajan Viswanathan, Chris Chu