Sciweavers

4998 search results - page 336 / 1000
» The case for intentional networking
Sort
View
ICDCSW
2006
IEEE
16 years 1 months ago
Enforcing Truthful-Rating Equilibria in Electronic Marketplaces
Reputation-based mechanisms and policies are vulnerable to the submission of untruthful ratings. In this paper, we define and analyze a game-theoretic model that captures the dyn...
Thanasis G. Papaioannou, George D. Stamoulis
CASCON
2007
106views Education» more  CASCON 2007»
15 years 9 months ago
Identifying active subgroups in online communities
As online communities proliferate, methods are needed to explore and capture patterns of activity within them. This paper focuses on the problem of identifying active subgroups wi...
Alvin Chin, Mark H. Chignell
SODA
2001
ACM
93views Algorithms» more  SODA 2001»
15 years 9 months ago
Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction
We consider worst case time bounds for NP-complete problems including 3-SAT, 3-coloring, 3-edge-coloring, and 3list-coloring. Our algorithms are based on a constraint satisfaction...
David Eppstein
ESANN
1998
15 years 9 months ago
Recurrent SOM with local linear models in time series prediction
Recurrent Self-Organizing Map (RSOM) is studied in three di erent time series prediction cases. RSOM is used to cluster the series into local data sets, for which corresponding lo...
Timo Koskela, Markus Varsta, Jukka Heikkonen, Kimm...
MP
2011
14 years 10 months ago
Strong KKT conditions and weak sharp solutions in convex-composite optimization
Using variational analysis techniques, we study convex-composite optimization problems. In connection with such a problem, we introduce several new notions as variances of the clas...
Xi Yin Zheng, Kung Fu Ng