Sciweavers

3894 search results - page 731 / 779
» Approximation Algorithms for Biclustering Problems
Sort
View
RC
2000
99views more  RC 2000»
14 years 11 months ago
Interval Constraint Plotting for Interactive Visual Exploration of Implicitly Defined Relations
Conventional plotting programs adopt techniques such as adaptive sampling to approximate, but not to guarantee, correctness and completeness in graphing functions. Moreover, implic...
Timothy J. Hickey, Zhe Qju, Maarten H. van Emden
RSA
2008
103views more  RSA 2008»
14 years 11 months ago
What is the furthest graph from a hereditary property?
For a graph property P, the edit distance of a graph G from P, denoted EP (G), is the minimum number of edge modifications (additions or deletions) one needs to apply to G in orde...
Noga Alon, Uri Stav
CONEXT
2010
ACM
14 years 10 months ago
Auto-configuration of 802.11n WLANs
Channel Bonding (CB) combines two adjacent frequency bands to form a new, wider band to facilitate high data rate transmissions in MIMO-based 802.11n networks. However, the use of...
Mustafa Y. Arslan, Konstantinos Pelechrinis, Ioann...
JIPS
2010
154views more  JIPS 2010»
14 years 6 months ago
Mining Spatio-Temporal Patterns in Trajectory Data
Spatio-temporal patterns extracted from historical trajectories of moving objects reveal important knowledge about movement behavior for high quality LBS services. Existing approac...
Juyoung Kang 0002, Hwan-Seung Yong
JMLR
2010
145views more  JMLR 2010»
14 years 6 months ago
Kernel Partial Least Squares is Universally Consistent
We prove the statistical consistency of kernel Partial Least Squares Regression applied to a bounded regression learning problem on a reproducing kernel Hilbert space. Partial Lea...
Gilles Blanchard, Nicole Krämer