Sciweavers

29918 search results - page 5581 / 5984
» A computational model of belief
Sort
View
RSA
2010
89views more  RSA 2010»
15 years 5 months ago
Some remarks on Betti numbers of random polygon spaces
Polygon spaces like Mℓ = {(u1, · · · , un) ∈ S1 × · · · S1 ; n i=1 liui = 0}/SO(2) or they three dimensional analogues Nℓ play an important rle in geometry and topolo...
Clément Dombry, Christian Mazza
200
Voted
RULEML
2010
Springer
15 years 5 months ago
Transformation of SBVR Compliant Business Rules to Executable FCL Rules
 The  main  source  of  changing  requirements  of  the  dynamic  business   environment  is  response  to  changes  in  regulations  and  contracts  towards  ...
Aqueo Kamada, Guido Governatori, Shazia Wasim Sadi...
206
Voted
SEKE
2010
Springer
15 years 5 months ago
A String Constraint Solver for Detecting Web Application Vulnerability
Given the bytecode of a software system, is it possible to automatically generate attack signatures that reveal its vulnerabilities? A natural solution would be symbolically execu...
Xiang Fu, Chung-Chih Li
203
Voted
SMC
2010
IEEE
202views Control Systems» more  SMC 2010»
15 years 5 months ago
Evaluating the performance of nonnegative matrix factorization for constructing semantic spaces: Comparison to latent semantic a
—This study examines the ability of nonnegative matrix factorization (NMF) as a method for constructing semantic spaces, in which the meaning of each word is represented by a hig...
Akira Utsumi
192
Voted
SPIRE
2010
Springer
15 years 5 months ago
Why Large Closest String Instances Are Easy to Solve in Practice
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
Christina Boucher, Kathleen Wilkie
« Prev « First page 5581 / 5984 Last » Next »