Sciweavers

468 search results - page 60 / 94
» Optimization of in-network data reduction
Sort
View
ICDT
2003
ACM
91views Database» more  ICDT 2003»
15 years 6 months ago
Reformulation of XML Queries and Constraints
We state and solve the query reformulation problem for XML publishing in a general setting that allows mixed (XML and relational) storage for the proprietary data and exploits redu...
Alin Deutsch, Val Tannen
NIPS
2007
15 years 2 months ago
Colored Maximum Variance Unfolding
Maximum variance unfolding (MVU) is an effective heuristic for dimensionality reduction. It produces a low-dimensional representation of the data by maximizing the variance of the...
Le Song, Alex J. Smola, Karsten M. Borgwardt, Arth...
MEMICS
2010
14 years 8 months ago
Modeling Gene Networks using Fuzzy Logic
Recently, almost uncontrolled technological progress allows so called high-throughput data collection for sophisticated and complex experimental biological systems analysis. Espec...
Artur Gintrowski
CODES
2007
IEEE
15 years 7 months ago
Compile-time decided instruction cache locking using worst-case execution paths
Caches are notorious for their unpredictability. It is difficult or even impossible to predict if a memory access results in a definite cache hit or miss. This unpredictability i...
Heiko Falk, Sascha Plazar, Henrik Theiling
MOBIDE
1999
ACM
15 years 5 months ago
Accelerating Telnet Performance in Wireless Networks
This paper describes the design of a system that significantly improves the performance of telnet data delivery for 3270 and 5250 emulation so that access to legacy applications v...
Barron C. Housel, Ian Shields