Sciweavers

12950 search results - page 2347 / 2590
» On Optimal Timed Strategies
Sort
View
ALENEX
2001
215views Algorithms» more  ALENEX 2001»
13 years 11 months ago
An Empirical Study of a New Approach to Nearest Neighbor Searching
In nearest neighbor searching we are given a set of n data points in real d-dimensional space, d , and the problem is to preprocess these points into a data structure, so that give...
Songrit Maneewongvatana, David M. Mount
CAINE
2003
13 years 11 months ago
Semi Greedy Algorithm for Finding Connectivity in Microchip Physical Layouts
Scan based or Line Sweep methods are a traditional mechanism to traverse the physical layout, or artwork of a microchip. These traversals are incremental in nature. They typically...
Clemente Izurieta
ICWN
2004
13 years 11 months ago
Energy-Efficient Graphical User Interface Design
Mobile computers, such as cell phones and personal digital assistants (PDAs), have dramatically increased in sophistication. At the same time, the desire of consumers for portabili...
Keith S. Vallerio, Lin Zhong, Niraj K. Jha
EON
2003
13 years 11 months ago
OntoTrack: Fast Browsing and Easy Editing of Large Ontologie
Abstract. OntoTrack is a new browsing and editing “in-one-view” ontology authoring tool. It combines a sophisticated graphical layout with mouse enabled editing features optimi...
Thorsten Liebig, Olaf Noppens
NETWORKING
2004
13 years 11 months ago
Scalable Packet Classification through Maximum Entropy Hashing
In this paper we propose a new packet classification algorithm, which can substantially improve the performance of a classifier by decreasing the rulebase lookup latency. The algor...
Lynn Choi, Jaesung Heo, Hyogon Kim, Jinoo Joung, S...
« Prev « First page 2347 / 2590 Last » Next »