Sciweavers

643 search results - page 71 / 129
» Parsing And Derivational Equivalence
Sort
View
ACML
2009
Springer
13 years 11 months ago
Max-margin Multiple-Instance Learning via Semidefinite Programming
In this paper, we present a novel semidefinite programming approach for multiple-instance learning. We first formulate the multipleinstance learning as a combinatorial maximum marg...
Yuhong Guo
APSEC
2001
IEEE
13 years 11 months ago
Expert Maintainers' Strategies and Needs when Understanding Software: A Case Study Approach
Accelerating the learning curve of software maintainers working on systems with which they have little familiarity motivated this study. A working hypothesis was that automated me...
Christos Tjortjis, Paul J. Layzell
ISMIS
2000
Springer
13 years 11 months ago
A Comparative Study of Noncontextual and Contextual Dependencies
There is current interest in generalizing Bayesian networks by using dependencies which are more general than probabilistic conditional independence (CI). Contextual dependencies, ...
S. K. Michael Wong, Cory J. Butz
ICCD
1995
IEEE
119views Hardware» more  ICCD 1995»
13 years 11 months ago
Extraction of finite state machines from transistor netlists by symbolic simulation
– This paper describes a new technique for extracting clock-level finite state machines(FSMs) from transistor netlists using symbolic simulation. The transistor netlist is prepr...
Manish Pandey, Alok Jain, Randal E. Bryant, Derek ...
ISLPED
1997
ACM
104views Hardware» more  ISLPED 1997»
13 years 11 months ago
Composite sequence compaction for finite-state machines using block entropy and high-order Markov models
- The objective of this paper is to provide an effective technique for accurate modeling of the external input sequences that affect the behavior of Finite State Machines (FSMs). B...
Radu Marculescu, Diana Marculescu, Massoud Pedram