Sciweavers

7006 search results - page 929 / 1402
» Approximation Algorithms
Sort
View
ADHOC
2005
116views more  ADHOC 2005»
15 years 7 months ago
Power efficient routing trees for ad hoc wireless networks using directional antenna
In ad hoc wireless networks, nodes are typically powered by batteries. Therefore saving energy has become a very important objective, and different algorithms have been proposed t...
Fei Dai, Qing Dai, Jie Wu
TKDE
2008
121views more  TKDE 2008»
15 years 7 months ago
Schema Matching Using Interattribute Dependencies
Schema matching is one of the key challenges in information integration. It is a labor-intensive and time-consuming process. To alleviate the problem, many automated solutions have...
Jaewoo Kang, Jeffrey F. Naughton
SAC
2002
ACM
15 years 7 months ago
Location adjustment for the minimum volume ellipsoid estimator
Estimating multivariate location and scatter with both affine equivariance and positive breakdown has always been difficult. A well-known estimator which satisfies both properties...
Christophe Croux, Gentiane Haesbroeck, Peter J. Ro...
210
Voted
INFOCOM
2010
IEEE
15 years 6 months ago
First-Fit Scheduling for Beaconing in Multihop Wireless Networks
—Beaconing is a primitive communication task in which every node locally broadcasts a packet to all its neighbors within a fixed distance. Assume that all communications proceed...
Peng-Jun Wan, Zhu Wang, Hongwei Du, Scott C.-H. Hu...
MFCS
2010
Springer
15 years 6 months ago
Solving minones-2-sat as Fast as vertex cover
The problem of finding a satisfying assignment for a 2-SAT formula that minimizes the number of variables that are set to 1 (min ones 2–sat) is NP-complete. It generalizes the w...
Neeldhara Misra, N. S. Narayanaswamy, Venkatesh Ra...