Sciweavers

382 search results - page 6 / 77
» Reasoning about the Elementary Functions of Complex Analysis
Sort
View
ADC
2004
Springer
90views Database» more  ADC 2004»
14 years 3 days ago
Representing and Reasoning on XForms Document
Forms are the most common way to interface users and Web-based applications. Traditional forms cannot provide the functionality needed to fulfil the requirements of complex appli...
Peng Yew Cheow, Guido Governatori
JELIA
2004
Springer
14 years 2 days ago
Towards a Logical Analysis of Biochemical Pathways
Biochemical pathways or networks are generic representations used to model many different types of complex functional and physical interactions in biological systems. Models based ...
Patrick Doherty, Steve Kertes, Martin Magnusson, A...
ICALP
2003
Springer
13 years 12 months ago
A Direct Sum Theorem in Communication Complexity via Message Compression
We prove lower bounds for the direct sum problem for two-party bounded error randomised multipleround communication protocols. Our proofs use the notion of information cost of a p...
Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
EWCBR
2006
Springer
13 years 10 months ago
An Analysis on Transformational Analogy: General Framework and Complexity
In this paper we present TransUCP, a general framework for transformational analogy. Using our framework we demonstrate that transformational analogy does not meet a crucial condit...
Vithal Kuchibatla, Héctor Muñoz-Avil...
STOC
2004
ACM
102views Algorithms» more  STOC 2004»
14 years 7 months ago
A simple polynomial-time rescaling algorithm for solving linear programs
The perceptron algorithm, developed mainly in the machine learning literature, is a simple greedy method for finding a feasible solution to a linear program (alternatively, for le...
John Dunagan, Santosh Vempala