Sciweavers

1322 search results - page 166 / 265
» Efficient Goal-Directed Exploration
Sort
View
137
Voted
KDD
2003
ACM
195views Data Mining» more  KDD 2003»
16 years 4 months ago
Visualizing changes in the structure of data for exploratory feature selection
Using visualization techniques to explore and understand high-dimensional data is an efficient way to combine human intelligence with the immense brute force computation power ava...
Elias Pampalk, Werner Goebl, Gerhard Widmer
101
Voted
CHI
2005
ACM
16 years 4 months ago
Flexible timeline user interface using constraints
Authoring tools routinely include a timeline representation to allow the author to specify the sequence of animations and interactions. However, traditional static timelines are b...
Kazutaka Kurihara, David Vronay, Takeo Igarashi
131
Voted
VLSID
2005
IEEE
167views VLSI» more  VLSID 2005»
16 years 4 months ago
A Methodology and Tooling Enabling Application Specific Processor Design
This paper presents a highly efficient processor design methodology based on the LISA 2.0 language. Typically the architecture design phase is dominated by an iterative processor ...
Andreas Hoffmann, Frank Fiedler, Achim Nohl, Suren...
132
Voted
VLSID
2002
IEEE
149views VLSI» more  VLSID 2002»
16 years 4 months ago
Functional Partitioning for Low Power Distributed Systems of Systems-on-a-Chip
In this paper, we present a functional partitioning method for low power real-time distributed embedded systems whose constituent nodes are systems-on-a-chip (SOCs). The systemlev...
Yunsi Fei, Niraj K. Jha
250
Voted
POPL
2007
ACM
16 years 4 months ago
Locality approximation using time
Reuse distance (i.e. LRU stack distance) precisely characterizes program locality and has been a basic tool for memory system research since the 1970s. However, the high cost of m...
Xipeng Shen, Jonathan Shaw, Brian Meeker, Chen Din...