Sciweavers

3946 search results - page 69 / 790
» The computational complexity of choice sets
Sort
View
BMVC
2010
14 years 10 months ago
Multiscale Keypoint Analysis based on Complex Wavelets
We describe a new multiscale keypoint detector and a set of local visual descriptors, both based on the efficient Dual-Tree Complex Wavelet Transform. The detector has properties ...
Pashmina Bendale, Bill Triggs, Nick G. Kingsbury
COMCOM
2004
85views more  COMCOM 2004»
14 years 11 months ago
Optimal PNNI complex node representations for restrictive costs
The Private Network-to-Network Interface (PNNI) is a scalable hierarchical protocol that allows ATM switches to be aggregated into clusters called peer groups. To provide good acc...
Ilias Iliadis
PVLDB
2008
100views more  PVLDB 2008»
14 years 11 months ago
Efficiently approximating query optimizer plan diagrams
Given a parametrized n-dimensional SQL query template and a choice of query optimizer, a plan diagram is a color-coded pictorial enumeration of the execution plan choices of the o...
Atreyee Dey, Sourjya Bhaumik, Harish D., Jayant R....
JETAI
2000
89views more  JETAI 2000»
14 years 11 months ago
Free will - even for robots
Human free will is a product of evolution and contributes to the success of the human animal. Useful robots will also require free will of a similar kind, and we will have to desi...
John McCarthy
INFOCOM
2007
IEEE
15 years 6 months ago
Distributed Low-Complexity Maximum-Throughput Scheduling for Wireless Backhaul Networks
— We introduce a low-complexity distributed slotted MAC protocol that can support all feasible arrival rates in a wireless backhaul network (WBN). For arbitrary wireless networks...
Abdul Kader Kabbani, Theodoros Salonidis, Edward W...