Sciweavers

116 search results - page 15 / 24
» Implicit B-Trees: New Results for the Dictionary Problem
Sort
View
TCAD
1998
86views more  TCAD 1998»
14 years 9 months ago
Fast heuristic and exact algorithms for two-level hazard-free logic minimization
None of the available minimizers for 2-level hazard-free logic minimization can synthesize very large circuits. This limitation has forced researchers to resort to manual and auto...
Michael Theobald, Steven M. Nowick
ICML
2006
IEEE
15 years 11 months ago
Iterative RELIEF for feature weighting
RELIEF is considered one of the most successful algorithms for assessing the quality of features. In this paper, we propose a set of new feature weighting algorithms that perform s...
Yijun Sun, Jian Li
ICDCSW
2007
IEEE
15 years 4 months ago
UBCA: Utility-Based Clustering Architecture for Peer-to-Peer Systems
Peer-to-Peer (P2P) systems are currently used in a variety of applications. File sharing applications and ad hoc networking have fueled the usage of these systems. P2P systems gen...
Brent Lagesse, Mohan Kumar
WEBI
2004
Springer
15 years 3 months ago
TSSP: A Reinforcement Algorithm to Find Related Papers
Content analysis and citation analysis are two common methods in recommending system. Compared with content analysis, citation analysis can discover more implicitly related papers...
Shen Huang, Gui-Rong Xue, Benyu Zhang, Zheng Chen,...
87
Voted
CVPR
2005
IEEE
16 years 3 days ago
Feature Uncertainty Arising from Covariant Image Noise
Uncertainty estimates related to the position of image features are seeing increasing use in several computer vision problems. Many of these have been recast from standard least s...
R. Matt Steele, Christopher O. Jaynes