Sciweavers

3145 search results - page 502 / 629
» Key Improvements to XTR
Sort
View
TCS
2008
15 years 6 months ago
Expanders and time-restricted branching programs
The replication number of a branching program is the minimum number R such that along every accepting computation at most R variables are tested more than once; the sets of variab...
Stasys Jukna
TDSC
2008
125views more  TDSC 2008»
15 years 6 months ago
Trustworthy Computing under Resource Constraints with the DOWN Policy
Trustworthy computing modules like secure coprocessors (ScP) are already in extensive use today, albeit limited predominantly to scenarios where constraints on cost is not a seriou...
Mahalingam Ramkumar
BIOINFORMATICS
2005
71views more  BIOINFORMATICS 2005»
15 years 6 months ago
Semi-supervised protein classification using cluster kernels
A key issue in supervised protein classification is the representation of input sequences of amino acids. Recent work using string kernels for protein data has achieved state-of-t...
Jason Weston, Christina S. Leslie, Eugene Ie, Deng...
JAIR
2007
95views more  JAIR 2007»
15 years 6 months ago
Consistency and Random Constraint Satisfaction Models
In this paper, we study the possibility of designing non-trivial random CSP models by exploiting the intrinsic connection between structures and typical-case hardness. We show tha...
Yong Gao, Joseph C. Culberson
TKDE
2008
121views more  TKDE 2008»
15 years 6 months ago
Schema Matching Using Interattribute Dependencies
Schema matching is one of the key challenges in information integration. It is a labor-intensive and time-consuming process. To alleviate the problem, many automated solutions have...
Jaewoo Kang, Jeffrey F. Naughton