Sciweavers

190 search results - page 30 / 38
» A Simple Proof Technique for Certain Parametricity Results
Sort
View
CORR
2000
Springer
103views Education» more  CORR 2000»
13 years 7 months ago
Automatic Termination Analysis of Programs Containing Arithmetic Predicates
For logic programs with arithmetic predicates, showing termination is not easy, since the usual order for the integers is not well-founded. A new method, easily incorporated in th...
Nachum Dershowitz, Naomi Lindenstrauss, Yehoshua S...
HICSS
2002
IEEE
113views Biometrics» more  HICSS 2002»
14 years 15 days ago
Persona: A Contextualized and Personalized Web Search
Abstract— Recent advances in graph-based search techniques derived from Kleinberg’s work [1] have been impressive. This paper further improves the graph-based search algorithm ...
Francisco Tanudjaja, Lik Mu
COCO
2000
Springer
65views Algorithms» more  COCO 2000»
13 years 12 months ago
On the Complexity of Quantum ACC
For any q > 1, let MODq be a quantum gate that determines if the number of 1’s in the input is divisible by q. We show that for any q, t > 1, MODq is equivalent to MODt (u...
Frederic Green, Steven Homer, Chris Pollett
BMCBI
2008
110views more  BMCBI 2008»
13 years 7 months ago
Determining significance of pairwise co-occurrences of events in bursty sequences
Background: Event sequences where different types of events often occur close together arise, e.g., when studying potential transcription factor binding sites (TFBS, events) of ce...
Niina Haiminen, Heikki Mannila, Evimaria Terzi
ISCAS
2008
IEEE
110views Hardware» more  ISCAS 2008»
14 years 1 months ago
Non-traditional irregular interconnects for massive scale SoC
— By using self-assembling fabrication techniques at the cellular, molecular, or atomic scale, it is nowadays possible to create functional assemblies in a mainly bottom-up way t...
Christof Teuscher, Anders A. Hansson