Sciweavers

3946 search results - page 339 / 790
» The computational complexity of choice sets
Sort
View
STOC
2010
ACM
185views Algorithms» more  STOC 2010»
15 years 10 months ago
Measuring independence of datasets
Approximating pairwise, or k-wise, independence with sublinear memory is of considerable importance in the data stream model. In the streaming model the joint distribution is give...
Vladimir Braverman, Rafail Ostrovsky
LACL
2011
Springer
14 years 9 months ago
Using Logic in the Generation of Referring Expressions
The problem of generating referring expressions (GRE) is an important task in natural language generation. In this paper, we advocate for the use of logical languages in the output...
Carlos Areces, Santiago Figueira, Daniel Gor&iacut...
SBP
2010
Springer
15 years 12 months ago
Social Network Data and Practices: The Case of Friendfeed
Due to their large worldwide adoption, Social Network Sites (SNSs) have been widely used in many global events as an important source to spread news and information. While the sear...
Fabio Celli, F. Marta L. Di Lascio, Matteo Magnani...
CONCUR
2001
Springer
15 years 11 months ago
Extended Temporal Logic Revisited
A key issue in the design of a model-checking tool is the choice of the formal language with which properties are specified. It is now recognized that a good language should exten...
Orna Kupferman, Nir Piterman, Moshe Y. Vardi
ECEASST
2010
15 years 4 months ago
Safe Integration of Annotated Components in Open Source Projects
: The decision of using existing software components versus building from scratch custom software is one of the most complex and important choices of the entire development/integra...
Sergio Areias, Daniela Carneiro da Cruz, Pedro Ran...