2740 search results - page 126 / 548 » Approximating Component Selection |
KAIS
2007
14 years 10 months ago
2007
With the proliferation of extremely high-dimensional data, feature selection algorithms have become indispensable components of the learning process. Strangely, despite extensive ...
ICCAD
2003
IEEE
15 years 7 months ago
2003
IEEE
– Many embedded system designs usually impose (hard) read-time constraints on tasks. Thus, computing a tight upper bound of the worst case execution time (WCET) of a software is ...
UIST
2009
ACM
15 years 4 months ago
2009
ACM
Time-series graphs are often used to visualize phenomena that change over time. Common tasks include comparing values at different points in time and searching for specified patte...
MOBIQUITOUS
2005
IEEE
15 years 3 months ago
2005
IEEE
Abstract— In future generation networks, various access technologies, such as Wi-Fi, Bluetooth, GPRS and UMTS, etc., are simultaneously available to mobile devices. They vary in ...
EDBT
2009
ACM
15 years 2 months ago
2009
ACM
A view selection algorithm takes as input a fact table and computes a set of views to store in order to speed up queries. The performance of view selection algorithm is usually me...