Sciweavers

738 search results - page 144 / 148
» Prime Implicant Computation Using Satisfiability Algorithms
Sort
View
COMCOM
2004
110views more  COMCOM 2004»
14 years 9 months ago
On the latency and fairness characteristics of pre-order deficit round Robin
In the emerging high-speed packet-switched networks, fair packet scheduling algorithms in switches and routers will form an important component of the mechanisms that seek to sati...
Salil S. Kanhere, Harish Sethu
WWW
2011
ACM
14 years 4 months ago
Design and implementation of contextual information portals
This paper presents a system for enabling offline web use to satisfy the information needs of disconnected communities. We describe the design, implementation, evaluation, and pil...
Jay Chen, Russell Power, Lakshminarayanan Subraman...
ECCV
2008
Springer
15 years 11 months ago
Robust 3D Pose Estimation and Efficient 2D Region-Based Segmentation from a 3D Shape Prior
In this work, we present an approach to jointly segment a rigid object in a 2D image and estimate its 3D pose, using the knowledge of a 3D model. We naturally couple the two proces...
Samuel Dambreville, Romeil Sandhu, Anthony J. Yezz...
DAC
2005
ACM
15 years 10 months ago
Memory access optimization through combined code scheduling, memory allocation, and array binding in embedded system design
In many of embedded systems, particularly for those with high data computations, the delay of memory access is one of the major bottlenecks in the system's performance. It ha...
Jungeun Kim, Taewhan Kim
KDD
2003
ACM
130views Data Mining» more  KDD 2003»
15 years 10 months ago
Towards systematic design of distance functions for data mining applications
Distance function computation is a key subtask in many data mining algorithms and applications. The most effective form of the distance function can only be expressed in the conte...
Charu C. Aggarwal