Sciweavers

2523 search results - page 220 / 505
» Objective: In Minimum Context
Sort
View
ANOR
2011
117views more  ANOR 2011»
14 years 8 months ago
A simple and effective algorithm for the MaxMin diversity problem
The challenge of maximizing the diversity of a collection of points arises in a variety of settings, including the setting of search methods for hard optimization problems. One ver...
Daniel Cosmin Porumbel, Jin-Kao Hao, Fred Glover
164
Voted
CHI
2009
ACM
15 years 9 months ago
Hyperlinking reality via camera phones
Mobile vision services are a type of mobile ITS applications that emerge with increased miniaturization of sensor and computing devices, such as in camera equipped mobile phones, ...
Dusan Omercevic, Ales Leonardis
BROADNETS
2007
IEEE
15 years 11 months ago
On supporting high quality 3D geometry multicasting over IEEE 802.11 wireless networks
—With significant improvements in both wireless technologies and computational capabilities of mobile devices, it is now possible to exchange and render 3D graphics over wireless...
Hui Li, Ming Li, B. Prabhakaran
ICDE
2011
IEEE
245views Database» more  ICDE 2011»
14 years 8 months ago
Stochastic skyline operator
— In many applications involving the multiple criteria optimal decision making, users may often want to make a personal trade-off among all optimal solutions. As a key feature, t...
Xuemin Lin, Ying Zhang, Wenjie Zhang, Muhammad Aam...
CORR
2007
Springer
126views Education» more  CORR 2007»
15 years 4 months ago
Dial a Ride from k-forest
The k-forest problem is a common generalization of both the k-MST and the dense-k-subgraph problems. Formally, given a metric space on n vertices V , with m demand pairs ⊆ V × ...
Anupam Gupta, MohammadTaghi Hajiaghayi, Viswanath ...