Sciweavers

1996 search results - page 373 / 400
» A decision procedure for linear
Sort
View
80
Voted
ECCC
2006
145views more  ECCC 2006»
14 years 10 months ago
Constraint satisfaction: a personal perspective
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
Tomás Feder
81
Voted
BMCBI
2007
144views more  BMCBI 2007»
14 years 10 months ago
Automatic delineation of malignancy in histopathological head and neck slides
Background: Histopathology, which is one of the most important routines of all laboratory procedures used in pathology, is decisive for the diagnosis of cancer. Experienced histop...
Mutlu Mete, Xiaowei Xu, Chun-Yang Fan, Gal Shafirs...
86
Voted
KER
2008
193views more  KER 2008»
14 years 10 months ago
The 1st international workshop on computational social choice
Computational social choice is a new discipline currently emerging at the interface of social choice theory and computer science. It is concerned with the application of computati...
Ulle Endriss
ENTCS
2007
178views more  ENTCS 2007»
14 years 10 months ago
Recent Advances in Real-Time Maude
This paper gives an overview of recent advances in Real-Time Maude. Real-Time Maude extends the Maude rewriting logic tool to support formal specification and analysis of object-...
Peter Csaba Ölveczky, José Meseguer
102
Voted
TCAD
2008
96views more  TCAD 2008»
14 years 10 months ago
An Implicit Approach to Minimizing Range-Equivalent Circuits
Abstract--Simplifying a combinational circuit while preserving its range has a variety of applications, such as combinational equivalence checking and random simulation. Previous a...
Yung-Chih Chen, Chun-Yao Wang