2680 search results - page 114 / 536 » The topology of the independence complex |
124
click to vote
KDD
2002
ACM
16 years 1 months ago
2002
ACM
In this paper we propose a scaling-up method that is applicable to essentially any induction algorithm based on discrete search. The result of applying the method to an algorithm ...
120
click to vote
EUROCRYPT
2005
Springer
15 years 6 months ago
2005
Springer
We revisit the following question: what are the minimal assumptions needed to construct statistically-hiding commitment schemes? Naor et al. show how to construct such schemes bas...
125
click to vote
INFOCOM
2003
IEEE
15 years 6 months ago
2003
IEEE
We investigate network management information for light-path assessment to dynamically set up end-to-end lightpaths across administrative domains. Our focus is on invetigating what...
134
click to vote
ALGORITHMICA
2008
15 years 1 months ago
2008
The profile of a graph is an integer-valued parameter defined via vertex orderings; it is known that the profile of a graph equals the smallest number of edges of an interval supe...
125
click to vote
JMLR
2008
15 years 1 months ago
2008
We describe and analyze an algorithmic framework for online classification where each online trial consists of multiple prediction tasks that are tied together. We tackle the prob...