Sciweavers

4255 search results - page 325 / 851
» On Learning Boolean Functions
Sort
View
CSB
2005
IEEE
133views Bioinformatics» more  CSB 2005»
16 years 8 days ago
Investigation into Biomedical Literature Classification Using Support Vector Machines
Specific topic search in the PubMed Database, one of the most important information resources for scientific community, presents a big challenge to the users. The researcher typic...
Nalini Polavarapu, Shamkant B. Navathe, Ramprasad ...
SSDBM
2005
IEEE
128views Database» more  SSDBM 2005»
16 years 7 days ago
Fuzzy Decomposition of Spatially Extended Objects
Modern database applications including computer-aided design, multimedia information systems, medical imaging, molecular biology, or geographical information systems impose new re...
Hans-Peter Kriegel, Martin Pfeifle
160
Voted
FORMATS
2005
Springer
16 years 6 days ago
Quantifying Similarities Between Timed Systems
We define quantitative similarity functions between timed transition systems that measure the degree of closeness of two systems as a real, in contrast to the traditional boolean ...
Thomas A. Henzinger, Rupak Majumdar, Vinayak S. Pr...
ICADL
2005
Springer
114views Education» more  ICADL 2005»
16 years 5 days ago
Scalability of Databases for Digital Libraries
Search engines of main-stream literature digital libraries such as ACM Digital Library, Google Scholar, and PubMed employ file-based systems, and provide users with a basic boolean...
John Chmura, Nattakarn Ratprasartporn, Gultekin &O...
WEA
2005
Springer
119views Algorithms» more  WEA 2005»
16 years 4 days ago
On Symbolic Scheduling Independent Tasks with Restricted Execution Times
Ordered Binary Decision Diagrams (OBDDs) are a data structure for Boolean functions which supports many useful operations. It finds applications in CAD, model checking, and symbol...
Daniel Sawitzki