Sciweavers

17505 search results - page 3332 / 3501
» Use Cases as Workflows
Sort
View
AINTEC
2007
Springer
16 years 19 days ago
WOD - Proxy-Based Web Object Delivery Service
With the tremendous growth of World Wide Web (WWW), the door has been opened to a multitude of services and information for even the most casual of users. Today, many wireless and ...
Kai-Hsiang Yang, Jan-Ming Ho
CIE
2007
Springer
16 years 18 days ago
Computational Complexity of Constraint Satisfaction
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...
Heribert Vollmer
COCOON
2007
Springer
16 years 18 days ago
Connected Coloring Completion for General Graphs: Algorithms and Complexity
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
Benny Chor, Michael R. Fellows, Mark A. Ragan, Igo...
COLT
2007
Springer
16 years 18 days ago
Resource-Bounded Information Gathering for Correlation Clustering
We present a new class of problems, called resource-bounded information gathering for correlation clustering. Our goal is to perform correlation clustering under circumstances in w...
Pallika Kanani, Andrew McCallum
CTRSA
2007
Springer
146views Cryptology» more  CTRSA 2007»
16 years 18 days ago
How to Strengthen Any Weakly Unforgeable Signature into a Strongly Unforgeable Signature
Standard signature schemes are usually designed only to achieve weak unforgeability – i.e. preventing forgery of signatures on new messages not previously signed. However, most s...
Ron Steinfeld, Josef Pieprzyk, Huaxiong Wang
« Prev « First page 3332 / 3501 Last » Next »