Sciweavers

4037 search results - page 774 / 808
» Routing without ordering
Sort
View
CORR
2006
Springer
109views Education» more  CORR 2006»
13 years 7 months ago
On Conditional Branches in Optimal Decision Trees
The decision tree is one of the most fundamental ing abstractions. A commonly used type of decision tree is the alphabetic binary tree, which uses (without loss of generality) &quo...
Michael B. Baer
IJCV
2008
192views more  IJCV 2008»
13 years 7 months ago
Learning to Locate Informative Features for Visual Identification
Object identification (OID) is specialized recognition where the category is known (e.g. cars) and the algorithm recognizes an object's exact identity (e.g. Bob's BMW). ...
Andras Ferencz, Erik G. Learned-Miller, Jitendra M...
BMCBI
2007
151views more  BMCBI 2007»
13 years 7 months ago
Identification of hot regions in protein-protein interactions by sequential pattern mining
Background: Identification of protein interacting sites is an important task in computational molecular biology. As more and more protein sequences are deposited without available...
Chen-Ming Hsu, Chien-Yu Chen, Baw-Jhiune Liu, Chih...
IJNSEC
2008
96views more  IJNSEC 2008»
13 years 7 months ago
Eliminating Quadratic Slowdown in Two-Prime RSA Function Sharing
The nature of the RSA public modulus N as a composite of at least two secret large primes was always considered as a major obstacle facing the RSA function sharing without the hel...
Maged Hamada Ibrahim
CN
2007
141views more  CN 2007»
13 years 7 months ago
Identifying lossy links in wired/wireless networks by exploiting sparse characteristics
In this paper, we consider the problem of estimating link loss rates based on end-to-end path loss rates in order to identify lossy links on the network. We first derive a maximu...
Hyuk Lim, Jennifer C. Hou