Sciweavers

2080 search results - page 242 / 416
» Measuring empirical computational complexity
Sort
View
CVPR
2010
IEEE
16 years 2 months ago
Use Bin-Ratio Information for Category and Scene Classification
In this paper we propose using bin-ratio information, which is collected from the ratios between bin values of histograms, for scene and category classification. To use such info...
Nianhua Xie, Haibin Ling, Weiming Hu, Xiaoqin Zhan...
PEWASUN
2006
ACM
15 years 12 months ago
Wave propagation using the photon path map
In wireless network planning, much effort is spent on the improvement of the network and transport layer – especially for Mobile Ad Hoc Networks. Although in principle realworl...
Arne Schmitz, Leif Kobbelt
SIGCSE
2006
ACM
158views Education» more  SIGCSE 2006»
15 years 12 months ago
Evaluations of target tracking in wireless sensor networks
Target tracking is one of the most important applications of wireless sensor networks. Optimized computation and energy dissipation are critical requirements to maximize the lifet...
Sam Phu Manh Tran, T. Andrew Yang
BROADNETS
2007
IEEE
15 years 7 months ago
Connection provisioning in QoT-guaranteed distributed all-optical networks
— As an optical signal propagates along a lightpath to its destination in wavelength-routed optical networks (WRONs), the quality of transmission (QoT) is degraded by transmissio...
Jun He, Maïté Brandt-Pearce, Suresh Su...
CORR
2002
Springer
111views Education» more  CORR 2002»
15 years 5 months ago
The Fastest and Shortest Algorithm for All Well-Defined Problems
An algorithm M is described that solves any well-defined problem p as quickly as the fastest algorithm computing a solution to p, save for a factor of 5 and loworder additive term...
Marcus Hutter